Approximation, Randomization and Combinatorial Optimization : Algorithms and Techniques: 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006 Barcelona, Spain, August

by Diaz, Josep; Jansen, Klaus; Rolim, Jose D. P.; Zwick, Uri

• ISBN13: 9783540380443
• ISBN10: 3540380442
• Format: Paperback
• Copyright: 2006-10-04
• Publisher: Springer Verlag

Summary

This book constitutes the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006, held in Barcelona, Spain, in August 2006. The 44 revised full papers presented were carefully reviewed and selected from 105 submissions. Among the topics covered are design and analysis of approximation algorithms, hardness of approximation problems, small spaces and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, game theory, network design and routing, packing and covering, scheduling, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness, derandomization, random combinatorial structures, Markov chains, prohabalistic proof systems, error-correcting codes, etc.

Table of Contents

Invited Talks
On Nontrivial Approximation of CSPs	p. 1
Analysis of Algorithms on the Cores of Random Graphs	p. 2
Contributed Talks of APPROX
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs	p. 3
Approximating Precedence-Constrained Single Machine Scheduling by Coloring	p. 15
Minimizing Setup and Beam-On Times in Radiation Therapy	p. 27
On the Value of Preemption in Scheduling	p. 39
An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs	p. 49
Tight Results on Minimum Entropy Set Cover	p. 61
A Tight Lower Bound for the Steiner Point Removal Problem on Trees. T.-H.	p. 70
Single-Source Stochastic Routing	p. 82
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem	p. 95
Online Algorithms to Minimize Resource Reallocations and Network Communication	p. 104
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs	p. 116
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time	p. 128
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times	p. 140
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees	p. 152
Improved Algorithms for Data Migration	p. 164
Approximation Algorithms for Graph Homomorphism Problems	p. 176
Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem	p. 188
Hardness of Preemptive Finite Capacity Dial-a-Ride Inge Li Gortz	p. 200
Minimum Vehicle Routing with a Common Deadline	p. 212
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level	p. 224
Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems Zeev Nutov	p. 236
Better Approximations for the Minimum Common Integer Partition Problem David P. Woodruff	p. 248
Contributed Talks of Random
On Pseudorandom Generators with Linear Stretch in NC[superscript 0]	p. 260
A Fast Random Sampling Algorithm for Sparsifying Matrices	p. 272
The Effect of Boundary Conditions on Mixing Rates of Markov Chains	p. 280
Adaptive Sampling and Fast Low-Rank Matrix Approximation	p. 292
Robust Local Testability of Tensor Products of LDPC Codes	p. 304
Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods	p. 316
Dobrushin Conditions and Systematic Scan	p. 327
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems	p. 339
Robust Mixing Murali K. Ganapathy	p. 351
Approximating Average Parameters of Graphs	p. 363
Local Decoding and Testing for Homomorphisms	p. 375
Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy Dan Gutfreund	p. 386
Randomness-Efficient Sampling Within NC[superscript 1] Alexander Healy	p. 398
Monotone Circuits for the Majority Function	p. 410
Space Complexity vs. Query Complexity	p. 426
Consistency of Local Density Matrices Is QMA-Complete Yi-Kai Liu	p. 438
On Bounded Distance Decoding for General Lattices	p. 450
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques	p. 462
Distance Approximation in Bounded-Degree and General Sparse Graphs	p. 475
Fractional Matching Via Balls-and-Bins	p. 487
A Randomized Solver for Linear Systems with Exponential Convergence	p. 499
Maintaining External Memory Efficient Hash Tables	p. 508
Author Index	p. 521
Table of Contents provided by Ingram. All Rights Reserved.