Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2462)
Included in the following conference series:
Conference proceedings info: APPROX 2002.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Keywords
Table of contents (22 papers)
Other volumes
-
Approximation Algorithms for Combinatorial Optimization
Editors and Affiliations
Bibliographic Information
Book Title: Approximation Algorithms for Combinatorial Optimization
Book Subtitle: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings
Editors: Klaus Jansen, Stefano Leonardi, Vijay Vazirani
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-45753-4
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2002
Softcover ISBN: 978-3-540-44186-1Published: 02 September 2002
eBook ISBN: 978-3-540-45753-4Published: 30 June 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 276
Topics: Programming Techniques, Theory of Computation, Optimization, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Numeric Computing