Skip to product information
Lectures on Proof Verification and Approximation Algorithms
Sale price
$49.49
Regular price $54.99
Reliable shipping
Flexible returns
Lecture Notes in Computer Science
Lectures on Proof Verification and Approximation Algorithms
Ernst W. Mayr | Hans Jürgen Prömel | Angelika Steger
Computers / Computer Science
During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabilistically checkable proofs and aproximation algorithms. The basic concepts, methods, and results are presented in a unified way to provide a smooth introduction for newcomers. These lectures are particularly useful for advanced courses or reading groups on the topic.
| Publication Date: | 25 February 1998 |
| Publisher: | Springer Berlin Heidelberg |
| Imprint: | Springer |
| ISBN-13: | 9783540642015 |
| Format: | Paperback softback |
| Page Count: | 348 |