Zum Hauptinhalt springen
Dekorationsartikel gehören nicht zum Leistungsumfang.
Lectures on Proof Verification and Approximation Algorithms
Taschenbuch von Ernst W. Mayr (u. a.)
Sprache: Englisch

53,49 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Aktuell nicht verfügbar

Kategorien:
Beschreibung
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.
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.
Zusammenfassung

This book coherently summarizes the spectacular progress achieved in the areas of approximation algorithms and combinatorial optimization during the last few years.

Includes supplementary material: [...]

Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: 1998
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Lecture Notes in Computer Science
Inhalt: xii
348 S.
ISBN-13: 9783540642015
ISBN-10: 3540642013
Sprache: Englisch
Herstellernummer: 10631845
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Redaktion: Mayr, Ernst W.
Steger, Angelika
Prömel, Hans Jürgen
Herausgeber: Ernst W Mayr/Hans Jürgen Prömel/Angelika Steger
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Lecture Notes in Computer Science
Maße: 235 x 155 x 20 mm
Von/Mit: Ernst W. Mayr (u. a.)
Erscheinungsdatum: 25.02.1998
Gewicht: 0,552 kg
Artikel-ID: 106848382
Zusammenfassung

This book coherently summarizes the spectacular progress achieved in the areas of approximation algorithms and combinatorial optimization during the last few years.

Includes supplementary material: [...]

Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: 1998
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Lecture Notes in Computer Science
Inhalt: xii
348 S.
ISBN-13: 9783540642015
ISBN-10: 3540642013
Sprache: Englisch
Herstellernummer: 10631845
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Redaktion: Mayr, Ernst W.
Steger, Angelika
Prömel, Hans Jürgen
Herausgeber: Ernst W Mayr/Hans Jürgen Prömel/Angelika Steger
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Lecture Notes in Computer Science
Maße: 235 x 155 x 20 mm
Von/Mit: Ernst W. Mayr (u. a.)
Erscheinungsdatum: 25.02.1998
Gewicht: 0,552 kg
Artikel-ID: 106848382
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte