Recherche et téléchargement gratuits de livres pdf Approximation Algorithms and Semidefinite Programming PDF PDB

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 introducti [....]

3.1 étoiles sur 5 de 479 Commentaires

Recherche et téléchargement gratuits de livres pdf Approximation Algorithms and Semidefinite Programming PDF PDB - 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."

Détails Approximation Algorithms and Semidefinite Programming

Le Titre Du Livre	Approximation Algorithms and Semidefinite Programming
EAN	9783642220142
Auteur	Bernd Gartner
ISBN-10	3642220142
Langue	Anglais
Nombre de pages	251 pages
Editeur	Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Catégories	Informatique et Internet
Évaluation du client	3.1 étoiles sur 5 de 479 Commentaires client
Nom de fichier	approximation-algorithms-and-semidefinite-programming.pdf
La taille du fichier	24.3 MB