Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2129)
Included in the following conference series:
- APPROX: International Workshop on Approximation Algorithms for Combinatorial Optimization
- RANDOM: International Workshop on Randomization and Approximation Techniques in Computer Science
Conference proceedings info: APPROX 2001, RANDOM 2001.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (31 papers)
-
Contributed Talks of RANDOM
Other volumes
-
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques
Keywords
About this book
Editors and Affiliations
Bibliographic Information
Book Title: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Book Subtitle: 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
Editors: Michel Goemans, Klaus Jansen, José D. P. Rolim, Luca Trevisan
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-44666-4
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2001
Softcover ISBN: 978-3-540-42470-3Published: 03 August 2001
eBook ISBN: 978-3-540-44666-8Published: 15 May 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: IX, 296
Topics: Analysis, Programming Techniques, Discrete Mathematics, Algorithm Analysis and Problem Complexity, Numeric Computing, Combinatorics
Industry Sectors: Energy, Utilities & Environment, Engineering, IT & Software