Lectures on Proof Verification and Approximation Algorithms

348 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

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.

• Reihe: Lecture Notes in Computer Science
• ISBN: 9783540642015
• Sprache: Englisch
• Erscheinungsdatum: 25.02.1998
• Genre: Informatik, EDV/Informatik
• Verlag: Springer Berlin
• Herausgegeben von: Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger