Contributed Talks of APPROX | |
The Network as a Storage Device: Dynamic Routing with Bounded Buffers | p. 1 |
Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT | p. 14 |
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs | p. 26 |
A Rounding Algorithm for Approximating Minimum Manhattan Networks | p. 40 |
Packing Element-Disjoint Steiner Trees | p. 52 |
Approximating the Bandwidth of Caterpillars | p. 62 |
Where's the Winner? Max-Finding and Sorting with Metric Costs | p. 74 |
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization | p. 86 |
The Complexity of Making Unique Choices: Approximating 1-in-k SAT | p. 99 |
Approximating the Distortion | p. 111 |
Approximating the Best-Fit Tree Under Lp Norms | p. 123 |
Beating a Random Assignment | p. 134 |
Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints | p. 146 |
Approximation Algorithms for Network Design and Facility Location with Service Capacities | p. 158 |
Finding Graph Matchings in Data Streams | p. 170 |
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses | p. 182 |
Efficient Approximation of Convex Recolorings | p. 192 |
Approximation Algorithms for Requirement Cut on Graphs | p. 209 |
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems | p. 221 |
Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy | p. 233 |
Contributed Talks of RANDOM | |
Bounds for Error Reduction with Few Quantum Queries | p. 245 |
Sampling Bounds for Stochastic Optimization | p. 257 |
An Improved Analysis of Mergers | p. 270 |
Finding a Maximum Independent Set in a Sparse Random Graph | p. 282 |
On the Error Parameter of Dispersers | p. 294 |
Tolerant Locally Testable Codes | p. 306 |
A Lower Bound on List Size for List Decoding | p. 318 |
A Lower Bound for Distribution-Free Monotonicity Testing | p. 330 |
On Learning Random DNF Formulas Under the Uniform Distribution | p. 342 |
Derandomized Constructions of k-Wise (Almost) Independent Permutations | p. 354 |
Testing Periodicity | p. 366 |
The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem | p. 378 |
The Online Clique Avoidance Game on Random Graphs | p. 390 |
A Generating Function Method for the Average-Case Analysis of DPLL | p. 402 |
A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas | p. 414 |
Mixing Points on a Circle | p. 426 |
Derandomized Squaring of Graphs | p. 436 |
Tight Bounds for String Reconstruction Using Substring Queries | p. 448 |
Reconstructive Dispersers and Hitting Set Generators | p. 460 |
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable | p. 472 |
Fractional Decompositions of Dense Hypergraphs | p. 482 |
Author Index | p. 495 |
Table of Contents provided by Publisher. All Rights Reserved. |