Lectures on Proof Verification and Approximation Algorithms (Lecture Notes in Computer Science)

Ernst W. Mayr, Hans J??rgen Pr??mel, Angelika Steger

ISBN 10: 3540642013 / ISBN 13: 9783540642015

Edité par Springer 2008-06-13, 2008

A propos de cet article

N° de réf. du vendeur 6666-IUK-9783540642015

Détails bibliographiques

• Titre: Lectures on Proof Verification and Approximation Algorithms (Lecture Notes in Computer Science)
• Éditeur: Springer 2008-06-13
• Date de parution: 2008
• Langue: anglais
• ISBN à 10 chiffres: 3540642013
• ISBN à 13 chiffres: 9783540642015
• Reliure: Paperback
• État de l'article: New

A propos de ce titre

Synopsis

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.