Approximation Algorithms and Semidefinite Programming

Springer (Verlag)
  • erschienen am 22. Februar 2014
  • Buch
  • |
  • Softcover
  • |
  • 264 Seiten
978-3-642-43332-0 (ISBN)
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.
  • Englisch
  • Heidelberg
  • |
  • Deutschland
Springer Berlin
  • Für Beruf und Forschung
  • |
  • Graduate
  • 10 s/w Tabellen
  • |
  • 10 Tables, black and white; XI, 251 p.
  • Höhe: 235 mm
  • |
  • Breite: 155 mm
  • |
  • Dicke: 14 mm
  • 406 gr
978-3-642-43332-0 (9783642433320)
weitere Ausgaben werden ermittelt

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.

DNB DDC Sachgruppen

Sofort lieferbar

32,09 €
inkl. 7% MwSt.
Sonderpreis bis 30.06.2020
Aktion Yellow Sale | statt 64,19 €
in den Warenkorb