Lectures on Proof Verification and Approximation Algorithms

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Mayr, Ernst W. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Prömel, Hans Jürgen (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Steger, Angelika (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
• Έκδοση: 1st ed. 1998.
• Σειρά: Lecture Notes in Computer Science, 1367
• Θέματα: Computers.; Algorithms.; Computer science-Mathematics.; Combinatorics.; Calculus of variations.; Theory of Computation.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Computation by Abstract Devices.; Calculus of Variations and Optimal Control; Optimization.
• Φυσική περιγραφή: XII, 348 p. online resource.
• ISBN: 9783540697015
• ISSN: 0302-9743 ;
• DOI: 10.1007/BFb0053010

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.