Titre :	Approximation algorithms and semidefinite programming
Type de document :	texte imprimé
Auteurs :	Bernd Gärtner, Auteur ; Matou¨ek, Jirí
Editeur :	Heidelberg : Springer
Année de publication :	2012
Importance :	1 vol.(251 p.)
Présentation :	ill.
Format :	24 cm
ISBN/ISSN/EAN :	978-3-642-22014-2
Note générale :	978-3-642-22014-2
Catégories :	Informatique
Mots-clés :	Approximation algorithms Semidefinite programming Algorithmes Programmation (mathématiques)
Index. décimale :	005.741 Méthodes d'accès et organisation des fichiers de données
Résumé :	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.
Côte titre :	Fs/16101-16105
En ligne :	https://www.amazon.fr/Approximation-Algorithms-Semidefinite-Programming-Gartner/ [...]
Format de la ressource électronique :	PDF

Approximation algorithms and semidefinite programming [texte imprimé] / Bernd Gärtner, Auteur ; Matou¨ek, Jirí . - Heidelberg : Springer, 2012 . - 1 vol.(251 p.) : ill. ; 24 cm.
ISBN : 978-3-642-22014-2
978-3-642-22014-2

Catégories :	Informatique
Mots-clés :	Approximation algorithms Semidefinite programming Algorithmes Programmation (mathématiques)
Index. décimale :	005.741 Méthodes d'accès et organisation des fichiers de données
Résumé :	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.
Côte titre :	Fs/16101-16105
En ligne :	https://www.amazon.fr/Approximation-Algorithms-Semidefinite-Programming-Gartner/ [...]
Format de la ressource électronique :	PDF