Approximation Algorithms and Semidefinite ...

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

85,59 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Aktuell nicht verfügbar

Kategorien:

Der Artikel ist nicht in deutscher Sprache verfasst.
Die Sprache der Produktbeschreibung und Details kann in Englisch angegeben sein. Sollten Sie Verständnisprobleme haben, wenden Sie sich gerne an uns.

Beschreibung

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material.
There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms.

This book follows the ¿semidefinite side¿ of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.

Zusammenfassung

First textbook treatment of an often-taught topic

Combines in-depth treatment of classical material with coverage of very recent developments

Every chapter comes with an extensive list of exercises

Includes supplementary material: [...]

Inhaltsverzeichnis

Part I (by Bernd Gärtner): 1 Introduction: MAXCUT via Semidefinite Programming.- 2 Semidefinite Programming.- 3 Shannon Capacity and Lovász Theta.- 4 Duality and Cone Programming.- 5 Approximately Solving Semidefinite Programs.- 6 An Interior-Point Algorithm for Semidefinite Programming.- 7 Compositive Programming.- Part II (by Jiri Matousek): 8 Lower Bounds for the Goemans-Williamson MAXCUT Algorithm .- 9 Coloring 3-Chromatic Graphs.- 10 Maximizing a Quadratic Form on a Graph.- 11 Colorings With Low Discrepancy.- 12 Constraint Satisfaction Problems, and Relaxing Them Semidefinitely.- 13 Rounding Via Miniatures.- Summary.- References.- Index.

Details

Erscheinungsjahr:	2012
Fachbereich:	Allgemeines
Genre:	Mathematik
Rubrik:	Naturwissenschaften & Technik
Medium:	Buch
Inhalt:	xi 251 S.
ISBN-13:	9783642220142
ISBN-10:	3642220142
Sprache:	Englisch
Herstellernummer:	80027048
Ausstattung / Beilage:	HC runder Rücken kaschiert
Einband:	Gebunden
Autor:	Matousek, Jiri Gärtner, Bernd
Hersteller:	Springer-Verlag GmbH Springer Berlin Heidelberg
Maße:	241 x 160 x 20 mm
Von/Mit:	Jiri Matousek (u. a.)
Erscheinungsdatum:	13.01.2012
Gewicht:	0,565 kg

Artikel-ID: 106809702