Contributed Talks of APPROX.- The Network as a Storage Device: Dynamic Routing with Bounded Buffers.- Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAXCUT.- What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.- A Rounding Algorithm for Approximating Minimum Manhattan Networks.- Packing Element-Disjoint Steiner Trees.- Approximating the Bandwidth of Caterpillars.- Where’s the Winner? Max-Finding and Sorting with Metric Costs.- What About Wednesday? Approximation Algorithms for Multistage Shastic Optimization.- The Complexity of Making Unique Choices: Approximating 1-in-k SAT.- Approximating the Distortion.- Approximating the Best-Fit Tree Under L p Norms.- Beating a Random Assignment.- Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints.- Approximation Algorithms for Network Design and Facility Location with Service Capacities.- Finding Graph Matchings in Data Streams.- A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.- Efficient Approximation of Convex Recolorings.- Approximation Algorithms for Requirement Cut on Graphs.- Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems.- Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy.- Contributed Talks of RANDOM.- Bounds for Error Reduction with Few Quantum Queries.- Sampling Bounds for Shastic Optimization.- An Improved Analysis of Mergers.- Finding a Maximum Independent Set in a Sparse Random Graph.- On the Error Parameter of Dispersers.- Tolerant Locally Testable Codes.- A Lower Bound on List Size for List Decoding.- A Lower Bound for Distribution-Free Monotonicity Testing.- On Learning Random DNF Formulas Under the Uniform Distribution.- Derandomized Constructions of k-Wise (Almost) Independent Permutations.- Testing Periodicity.- The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem.- The Online Clique Avoidance Game on Random Graphs.- A Generating Function Method for the Average-Case Analysis of DPLL.- A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas.- Mixing Points on a Circle.- Derandomized Squaring of Graphs.- Tight Bounds for String Reconstruction Using Substring Queries.- Reconstructive Dispersers and Hitting Set Generators.- The Tensor Product of Two Codes Is Not Necessarily Robustly Testable.- Fractional Decompositions of Dense Hypergraphs.
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization / Edition 1by Chandra Chekuri, Klaus Jansen, Jose D.P. Rolim, Luca Trevisan
Pub. Date: 01/15/2008
Publisher: Springer Berlin Heidelberg
This book constitutes the joint refereed proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and the 9th International Workshop on Randomization and Computation, RANDOM 2005, held in Berkeley, CA, USA in August 2005. The volume contains 41 carefully reviewed papers, selected by the two
This book constitutes the joint refereed proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and the 9th International Workshop on Randomization and Computation, RANDOM 2005, held in Berkeley, CA, USA in August 2005. The volume contains 41 carefully reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed 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.
- Springer Berlin Heidelberg
- Publication date:
- Lecture Notes in Computer Science / Theoretical Computer Science and General Issues Series , #3624
- Edition description:
- Product dimensions:
- 9.21(w) x 6.14(h) x 1.03(d)
Table of Contents
Most Helpful Customer Reviews
See all customer reviews