Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques

Goemans, Michel, Jansen, Klaus ; Rolim, Jose D.P ; Trevisan, Luca

ISBN 10: 3540424709 / ISBN 13: 9783540424703

Published by Springer Verlag, New York, 2001

About this Item

Hardcover 2001 library bound edition. Ex-library book with stamps and labels attached. Binding firm. Pages unmarked and clean. Laminated covers and text in very good condition. Series: Lecture Notes in Computer Science ;2129. 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. [ix, 296 p. : ill. ; 24 cm].

Seller Inventory # 010803

Bibliographic Details

• Title: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques
• Publisher: Springer Verlag, New York
• Publication Date: 2001
• Language: English
• ISBN 10: 3540424709
• ISBN 13: 9783540424703
• Binding: Hardcover
• Condition: Very Good
• Dust Jacket Condition: No Jacket
• Seller catalogs:
  • Computer

About this title

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.