Matches in Harvard for { <http://id.lib.harvard.edu/aleph/007937796/catalog> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- catalog abstract "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.".
- catalog contributor b11001900.
- catalog contributor b11001901.
- catalog contributor b11001902.
- catalog created "c1998.".
- catalog date "1998".
- catalog date "c1998.".
- catalog dateCopyrighted "c1998.".
- catalog description "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.".
- catalog description "Includes bibliographical references (p. [325]-334) and indexes.".
- catalog description "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.".
- catalog extent "xii, 344 p. :".
- catalog identifier "3540642013 (Berlin : alk. paper)".
- catalog isPartOf "Lecture notes in computer science, 0302-9743 ; 1367".
- catalog issued "1998".
- catalog issued "c1998.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "005.1/4 21".
- catalog subject "Approximation theory.".
- catalog subject "Automatic theorem proving.".
- catalog subject "Combinatorics.".
- catalog subject "Computational complexity.".
- catalog subject "Computer algorithms.".
- catalog subject "Computer science.".
- catalog subject "Computer software.".
- catalog subject "Electronic data processing.".
- catalog subject "Mathematical optimization.".
- catalog subject "QA76.9.A96 L43 1998".
- catalog tableOfContents "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.".
- catalog title "Lectures on proof verification and approximation algorithms / Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger (eds.).".
- catalog type "text".