Kostenloser Versand
Bequem zahlen
Wir sind gerne für Sie daDuring 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.
Produkteigenschaften
- Artikelnummer: 9783540642015
- Medium: Buch
- ISBN: 978-3-540-64201-5
- Verlag: J.B. Metzler
- Erscheinungstermin: 25.02.1998
- Sprache(n): Englisch
- Auflage: 1. Auflage 1998
- Serie: Lecture Notes in Computer Science
- Produktform: Kartoniert, Paperback
- Gewicht: 1130 g
- Seiten: 348
- Format (B x H x T): 155 x 235 x 20 mm
- Ausgabetyp: Kein, Unbekannt