Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques

4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, August 18-20, 2001

296 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.

• Reihe: Lecture Notes in Computer Science
• ISBN: 9783540424703
• Sprache: Englisch
• Erscheinungsdatum: 03.08.2001
• Genre: Mathematik/Analysis
• Verlag: Springer Berlin
• Herausgegeben von: Michel Goemans, Klaus Jansen, Jose D.P. Rolim, Luca Trevisan