Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques: 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003. Proceedings

✍ Scribed by Erik D. Demaine, Nicole Immorlica (auth.), Sanjeev Arora, Klaus Jansen, José D. P. Rolim, Amit Sahai (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2003
• Tongue: English
• Leaves: 418
• Series: Lecture Notes in Computer Science 2764
• Edition: 1
• Category: Library

✦ Synopsis

This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003.

The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.

✦ Table of Contents

Front Matter....Pages -
Correlation Clustering with Partial Information....Pages 1-13
Improved Linear Time Approximation Algorithms for Weighted Matchings....Pages 14-23
Covering Graphs Using Trees and Stars....Pages 24-35
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor....Pages 36-46
Approximation Algorithms for Channel Allocation Problems in Broadcast Networks....Pages 47-58
Asymmetry in k -Center Variants....Pages 59-70
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times....Pages 71-82
On the Complexity of Approximating k -Dimensional Matching....Pages 83-97
Approximating Market Equilibria....Pages 98-108
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem....Pages 109-121
On the Hardness of Approximate Multivariate Integration....Pages 122-128
A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem....Pages 129-140
Approximating Rooted Connectivity Augmentation Problems....Pages 141-152
Effective Routing and Scheduling in Adversarial Queueing Networks....Pages 153-164
Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement....Pages 165-177
An Improved Algorithm for Approximating the Radii of Point Sets....Pages 178-187
Testing Low-Degree Polynomials over GF (2)....Pages 188-199
Computational Analogues of Entropy....Pages 200-215
Bounds on 2-Query Codeword Testing....Pages 216-227
The Lovász Number of Random Graphs....Pages 228-239
Perfectly Balanced Allocation....Pages 240-251
On Extracting Private Randomness over a Public Channel....Pages 252-263
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph....Pages 264-274
The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems....Pages 275-289
Continuous-Time Quantum Walks on the Symmetric Group....Pages 290-301
Distribution-Free Property Testing....Pages 302-317
On the Graph-Density of Random 0/1-Polytopes....Pages 318-328
A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding....Pages 329-340
Tight Bounds for Testing Bipartiteness in General Graphs....Pages 341-353
Discrete Quantum Walks Hit Exponentially Faster....Pages 354-369
Approximate Testing of Visual Properties....Pages 370-381
Faster Algorithms for MAX CUT and MAX CSP , with Polynomial Expected Time for Sparse Instances....Pages 382-395
A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries....Pages 396-408
Back Matter....Pages -

✦ Subjects

Algorithm Analysis and Problem Complexity; Numeric Computing; Discrete Mathematics in Computer Science; Algorithms; Combinatorics