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 81.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
V103:
Folgt in ca. 5 Arbeitstagen
Produktdetails
Weitere Autoren: Prömel, Hans Jürgen (Hrsg.) / Steger, Angelika (Hrsg.)
- ISBN: 978-3-540-64201-5
- EAN: 9783540642015
- Produktnummer: 3298890
- Verlag: Springer Berlin Heidelberg
- Sprache: Englisch
- Erscheinungsjahr: 1998
- Seitenangabe: 364 S.
- Masse: H23.5 cm x B15.5 cm x D1.9 cm 552 g
- Auflage: 1998
- Abbildungen: Paperback
- Gewicht: 552
29 weitere Werke von Ernst W. (Hrsg.) Mayr:
Bewertungen
Anmelden