Approximation, Randomization and Combinatorial Optimization: 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 (2001) (Lecture Notes in Computer Science #2129)

Synopsis

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.

Copyright:

2001

Book Details

Book Quality:

Publisher Quality

ISBN-13:

9783540446668

Related ISBNs:

9783540424703

Publisher:

Springer Berlin Heidelberg

Date of Addition:

08/04/22

Copyrighted By:

N/A

Adult content:

No

Language:

English

Has Image Descriptions:

No

Categories:

Nonfiction, Computers and Internet, Mathematics and Statistics

Submitted By:

Bookshare Staff

Usage Restrictions:

This is a copyrighted book.

Edited by:

Michel Goemans

Edited by:

Klaus Jansen

Edited by:

Jose D.P. Rolim

Edited by:

Luca Trevisan