Willkommen, schön sind Sie da!
Logo Ex Libris

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

  • Kartonierter Einband
  • 640 Seiten
(0) Erste Bewertung abgeben
Bewertungen
(0)
(0)
(0)
(0)
(0)
Alle Bewertungen ansehen
This volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Opt... Weiterlesen
20%
144.00 CHF 115.20
Sie sparen CHF 28.80
Auslieferung erfolgt in der Regel innert 2 bis 4 Werktagen.
Bestellung & Lieferung in eine Filiale möglich

Beschreibung

This volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation. The papers cover design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and much more.



Presents the proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation

Includes 44 full papers presenting some of the latest findings in the field

Covers design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, and much more



Klappentext

This book constitutes the joint refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and the 11th International Workshop on Randomization and Computation, RANDOM 2007, held in Princeton, NJ, USA, in August 2007. The 44 revised full papers presented were carefully reviewed and selected from 99 submissions. Topics of interest covered by the papers are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, geometric problems, game theory and applications, network design and routing, packing and covering, scheduling, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of approximation and randomness.

Inhalt
Contributed Talks of APPROX.- Approximation Algorithms and Hardness for Domination with Propagation.- A Knapsack Secretary Problem with Applications.- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.- Improved Approximation Algorithms for the Spanning Star Forest Problem.- Packing and Covering ?-Hyperbolic Spaces by Balls.- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems.- Two Randomized Mechanisms for Combinatorial Auctions.- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs.- Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows.- Stochastic Steiner Tree with Non-uniform Inflation.- On the Approximation Resistance of a Random Predicate.- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ?1 Embeddability of Negative Type Metrics.- Optimal Resource Augmentations for Online Knapsack.- Soft Edge Coloring.- Approximation Algorithms for the Max-Min Allocation Problem.- Hardness of Embedding Metric Spaces of Equal Size.- Coarse Differentiation and Multi-flows in Planar Graphs.- Maximum Gradient Embeddings and Monotone Clustering.- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems.- Encouraging Cooperation in Sharing Supermodular Costs.- Almost Exact Matchings.- Contributed Talks of RANDOM.- On Approximating the Average Distance Between Points.- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR.- A Sequential Algorithm for Generating Random Graphs.- Local Limit Theorems for the Giant Component of Random Hypergraphs.- Derandomization of Euclidean Random Walks.- High Entropy Random Selection Protocols.- Testing st-Connectivity.- Properly 2-Colouring Linear Hypergraphs.- Random Subsets of the Interval and P2P Protocols.- The Cover Time of Random Digraphs.- Eigenvectors of Random Graphs: Nodal Domains.- Lower Bounds for Swapping Arthur and Merlin.- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects.- On Estimating Frequency Moments of Data Streams.- Distribution-Free Testing Lower Bounds for Basic Boolean Functions.- On the Randomness Complexity of Property Testing.- On the Benefits of Adaptivity in Property Testing of Dense Graphs.- Slow Mixing of Markov Chains Using Fault Lines and Fat Contours.- Better Binary List-Decodable Codes Via Multilevel Concatenation.- Worst-Case to Average-Case Reductions Revisited.- On Finding Frequent Elements in a Data Stream.- Implementing Huge Sparse Random Graphs.- Sublinear Algorithms for Approximating String Compressibility.

Produktinformationen

Titel: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Untertitel: 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings
Editor:
EAN: 9783540742074
ISBN: 3540742077
Format: Kartonierter Einband
Herausgeber: Springer Berlin Heidelberg
Genre: Informatik
Anzahl Seiten: 640
Gewicht: 955g
Größe: H235mm x B155mm x T34mm
Jahr: 2007
Untertitel: Englisch
Auflage: 2007

Weitere Produkte aus der Reihe "Theoretical Computer Science and General Issues"