Verwandte Artikel zu Approximation Algorithms and Semidefinite Programming

Approximation Algorithms and Semidefinite Programming - Softcover

 
9783642433320: Approximation Algorithms and Semidefinite Programming
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:
 
 
Reseña del editor:

This introduction to aspects of semidefinite programming and its use in approximation algorithms develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others.

Contraportada:

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

  • VerlagSpringer
  • Erscheinungsdatum2014
  • ISBN 10 3642433324
  • ISBN 13 9783642433320
  • EinbandTapa blanda
  • Anzahl der Seiten264

Weitere beliebte Ausgaben desselben Titels

9783642220142: Approximation Algorithms and Semidefinite Programming

Vorgestellte Ausgabe

ISBN 10:  ISBN 13:  9783642220142
Verlag: Springer, 2012
Hardcover

  • 9783642220166: Approximation Algorithms and Semidefinite Programming

    Springer, 2012
    Softcover

Beste Suchergebnisse beim ZVAB

Foto des Verkäufers

Jiri Matousek
ISBN 10: 3642433324 ISBN 13: 9783642433320
Neu Taschenbuch Anzahl: 1
Anbieter:
AHA-BUCH GmbH
(Einbeck, Deutschland)
Bewertung

Buchbeschreibung Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Artikel-Nr. 9783642433320

Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren

Neu kaufen
EUR 63,06
Währung umrechnen

In den Warenkorb

Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer