Lectures on Proof Verification and Approximation Algorithms
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…
Mehr
CHF 67.50
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
Versandkostenfrei
Produktdetails
Weitere Autoren: Prömel, Hans Jürgen (Hrsg.) / Steger, Angelika (Hrsg.)
- ISBN: 978-3-540-69701-5
- EAN: 9783540697015
- Produktnummer: 37237031
- Verlag: Springer Berlin Heidelberg
- Sprache: Englisch
- Erscheinungsjahr: 2006
- Seitenangabe: 348 S.
- Plattform: PDF
- Auflage: 1998
- Reihenbandnummer: 1367
29 weitere Werke von Ernst W. (Hrsg.) Mayr:
Bewertungen
Anmelden