ENGLISH

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 Proceedings

By Klaus Jansen , José D. P. Rolim , Luca Trevisan (eds.) , Michel X. Goemans (auth.) , Michel Goemans

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2001
ISBN
978-3-540-42470-3, 978-3-540-44666-8, 3-540-42470-9
DOI
10.1007/3-540-44666-4
Language
english
Format
PDF
Filesize
3 MB (3411073 bytes)
Series
Lecture Notes in Computer Science 2129
Edition
1
Pages
296\314
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; Numeric

Description

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.

Similar books