Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Taschenbuch

EAN (ISBN-13): 9783642153686
ISBN (ISBN-10): 3642153682
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2010
Herausgeber: Springer Berlin
782 Seiten
Gewicht: 1,130 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2008-01-16T07:13:54+01:00 (Berlin)
Detailseite zuletzt geändert am 2024-01-05T00:22:35+01:00 (Berlin)
ISBN/EAN: 9783642153686

ISBN - alternative Schreibweisen:
3-642-15368-2, 978-3-642-15368-6
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: serna, jansen klaus, maria klaus, ronen
Titel des Buches: approximation algorithms, international optimization, combinatorial algorithms, workshop techniques, lecture notes computer science

---

Daten vom Verlag:

Autor/in: Maria Serna; Ronen Shaltiel; Klaus Jansen; José Rolim
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings
Verlag: Springer; Springer Berlin
782 Seiten
Erscheinungsjahr: 2010-08-19
Berlin; Heidelberg; DE
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XIII, 782 p. 54 illus.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Computerprogrammierung und Softwareentwicklung; Verstehen; algebraic codes; algorithm analysis; algorithms; approximation algorithms; coding theory; combinatorial optimization; combinatorics; complexity; e-learning; game theory; geometry; graph algorithms; graph theory; algorithm analysis and problem complexity; data structures; Programming Techniques; Computer Communication Networks; Theory of Computation; Algorithms; Discrete Mathematics in Computer Science; Data Science; Netzwerk-Hardware; Theoretische Informatik; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Datenbanken; EA

Contributed Talks of APPROX.- Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem.- Improved Inapproximability for Submodular Maximization.- Approximation Algorithms for the Directed k-Tour and k-Stroll Problems.- Submodular Secretary Problem and Extensions.- Approximation Algorithms for Min-Max Generalization Problems.- Min-Power Strong Connectivity.- The Complexity of Approximately Counting Stable Matchings.- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs.- Approximating Linear Threshold Predicates.- Approximating Sparsest Cut in Graphs of Bounded Treewidth.- On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors.- Vertex Sparsifiers: New Results from Old Techniques.- PTAS for Weighted Set Cover on Unit Squares.- Improved Lower Bounds for the Universal and a priori TSP.- Proximity Algorithms for Nearly-Doubling Spaces.- Matrix Sparsification and the Sparse Null Space Problem.- The Checkpoint Problem.- The Euclidean Distortion of Flat Tori.- Online Embeddings.- Approximation Algorithms for Intersection Graphs.- An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs.- Improved Algorithm for the Half-Disjoint Paths Problem.- Approximate Lasserre Integrality Gap for Unique Games.- Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses.- Maximum Flows on Disjoint Paths.- Approximation Algorithms for Reliable Stochastic Combinatorial Optimization.- How to Schedule When You Have to Buy Your Energy.- Improving Integrality Gaps via Chvátal-Gomory Rounding.- Contributed Talks of RANDOM.- Uniform Derandomization from Pathetic Lower Bounds.- Testing Boolean FunctionIsomorphism.- Better Size Estimation for Sparse Matrix Products.- Low Rate Is Insufficient for Local Testability.- Reconstruction Threshold for the Hardcore Model.- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners.- Monotonicity Testing and Shortest-Path Routing on the Cube.- Better Gap-Hamming Lower Bounds via Better Round Elimination.- Propagation Connectivity of Random Hypergraphs.- Improved Pseudorandom Generators for Depth 2 Circuits.- The Structure of Winning Strategies in Parallel Repetition Games.- Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of Queries.- Periodicity in Streams.- Rumor Spreading on Random Regular Graphs and Expanders.- On Testing Computability by Small Width OBDDs.- Learning and Lower Bounds for AC 0 with Threshold Gates.- Liftings of Tree-Structured Markov Chains.- Constructive Proofs of Concentration Bounds.- Almost-Euclidean Subspaces of via Tensor Products: A Simple Approach to Randomness Reduction.- Testing Outerplanarity of Bounded Degree Graphs.- Two-Source Extractors Secure against Quantum Adversaries.- Locally Testable vs. Locally Decodable Codes.- Differential Privacy and the Fat-Shattering Dimension of Linear Queries.- Two Theorems on List Decoding.- Delaying Satisfiability for Random 2SAT.- Improved Rounding for Parallel Repeated Unique Games.- A Query Efficient Non-adaptive Long Code Test with Perfect Completeness.- Relativized Worlds without Worst-Case to Average-Case Reductions for NP.- A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field.
Unique visibility State-of-the-art survey Fast-track conference proceedings