Del i serien Lecture Notes in Computer Science

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings

Häftad, Engelska, 2007

AvMoses Charikar,Klaus Jansen,Omer Reingold,José D.P. Rolim

1 449 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2007-08-07
Mått155 x 235 x 35 mm
Vikt955 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor628
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540742074

Tillhör följande kategorier

Programmeringsböcker inom Data och IT

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.- Testingst-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.