, ,

Lectures on Proof Verification and Approximation Algorithms

Paperback Engels 1998 1998e druk 9783540642015
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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.

Specificaties

ISBN13:9783540642015
Taal:Engels
Bindwijze:paperback
Aantal pagina's:348
Uitgever:Springer Berlin Heidelberg
Druk:1998

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Inhoudsopgave

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.

Managementboek Top 100

Rubrieken

    Personen

      Trefwoorden

        Lectures on Proof Verification and Approximation Algorithms