![Lectures on Proof Verification and Approximation Algorithms [electronic resource] /](/search/themes/bootstrap3/images/libros.png)
Lectures on Proof Verification and Approximation Algorithms [electronic resource] /
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.
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,
1998
|
| Subjects: | Computer science., Computers., Algorithms., Computer science, Calculus of variations., Combinatorics., Computer Science., Theory of Computation., Algorithm Analysis and Problem Complexity., Discrete Mathematics in Computer Science., Computation by Abstract Devices., Calculus of Variations and Optimal Control; Optimization., |
| Online Access: | http://dx.doi.org/10.1007/BFb0053010 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|