Editors:
- This book coherently summarizes the spectacular progress achieved in the areas of approximation algorithms and combinatorial optimization during the last few years.
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1367)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (13 chapters)
-
Front Matter
-
Back Matter
About this book
Bibliographic Information
Book Title: Lectures on Proof Verification and Approximation Algorithms
Editors: Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/BFb0053010
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1998
Softcover ISBN: 978-3-540-64201-5Published: 25 February 1998
eBook ISBN: 978-3-540-69701-5Published: 08 June 2006
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 348
Topics: Theory of Computation, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Computation by Abstract Devices, Combinatorics, Calculus of Variations and Optimal Control; Optimization