1 option
Lectures on Proof Verification and Approximation Algorithms / edited by Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1367.
- Lecture Notes in Computer Science, 0302-9743 ; 1367
- Language:
- English
- Subjects (All):
- Computers.
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Combinatorial analysis.
- Calculus of variations.
- Theory of Computation.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Computation by Abstract Devices.
- Combinatorics.
- Calculus of Variations and Optimal Control; Optimization.
- Local Subjects:
- Theory of Computation.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Computation by Abstract Devices.
- Combinatorics.
- Calculus of Variations and Optimal Control; Optimization.
- Physical Description:
- 1 online resource (XII, 348 pages).
- Edition:
- First edition 1998.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- to the theory of complexity and approximation algorithms
- to randomized algorithms
- Derandomization
- Proof checking and non-approximability
- Proving the PCP-Theorem
- Parallel repetition of MIP(2,1) systems
- Bounds for approximating MaxLinEq3-2 and MaxEkSat
- Deriving non-approximability results by reductions
- Optimal non-approximability of MaxClique
- The hardness of approximating set cover
- Semidefinite programming and its applications to approximation algorithms
- Dense instances of hard optimization problems
- Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-69701-5
- 9783540697015
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.