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.ary error-correcting code C C {1, 2, ..., q}n is said to be list decodable to radius p with list size L if every Hamming ball of radius p contains at most L codewords of C. We prove that in order for a g-ary code to be list-decodable up to radius (1anbsp;...

Title | : | Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques |

Author | : | Chandra Chekuri |

Publisher | : | Springer Science & Business Media - 2005-08-08 |

Continue