Articles liés à Approximation Algorithms and Semidefinite Programming

Approximation Algorithms and Semidefinite Programming - Couverture souple

 
9783642433320: Approximation Algorithms and Semidefinite Programming

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Acheter D'occasion

état :  Comme neuf
Unread book in perfect condition...
Afficher cet article
EUR 121,24

Autre devise

EUR 17,31 expédition depuis Royaume-Uni vers France

Destinations, frais et délais

Acheter neuf

Afficher cet article
EUR 53,22

Autre devise

EUR 9,70 expédition depuis Allemagne vers France

Destinations, frais et délais

Autres éditions populaires du même titre

9783642220142: Approximation Algorithms and Semidefinite Programming

Edition présentée

ISBN 10 :  3642220142 ISBN 13 :  9783642220142
Editeur : Springer-Verlag Berlin and Heide..., 2012
Couverture rigide

Résultats de recherche pour Approximation Algorithms and Semidefinite Programming

Image fournie par le vendeur

Bernd Gärtner|Jiri Matousek
Edité par Springer Berlin Heidelberg, 2014
ISBN 10 : 3642433324 ISBN 13 : 9783642433320
Neuf Couverture souple
impression à la demande

Vendeur : moluna, Greven, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. First textbook treatment of an often-taught topicCombines in-depth treatment of classical material with coverage of very recent developmentsEvery chapter comes with an extensive list of exercisesSemidefinite programs constitute o. N° de réf. du vendeur 5060715

Contacter le vendeur

Acheter neuf

EUR 53,22
Autre devise
Frais de port : EUR 9,70
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Gärtner, Bernd; Matousek, Jiri
Edité par Springer, 2014
ISBN 10 : 3642433324 ISBN 13 : 9783642433320
Neuf Couverture souple

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. In. N° de réf. du vendeur ria9783642433320_new

Contacter le vendeur

Acheter neuf

EUR 66,59
Autre devise
Frais de port : EUR 4,60
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Gartner, Bernd
Edité par Springer 2014-02, 2014
ISBN 10 : 3642433324 ISBN 13 : 9783642433320
Neuf PF

Vendeur : Chiron Media, Wallingford, Royaume-Uni

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783642433320

Contacter le vendeur

Acheter neuf

EUR 60,87
Autre devise
Frais de port : EUR 10,95
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : 10 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Jiri Matousek
Edité par Springer Berlin Heidelberg, 2014
ISBN 10 : 3642433324 ISBN 13 : 9783642433320
Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : 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. N° de réf. du vendeur 9783642433320

Contacter le vendeur

Acheter neuf

EUR 60,98
Autre devise
Frais de port : EUR 10,99
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Jiri Matousek
ISBN 10 : 3642433324 ISBN 13 : 9783642433320
Neuf Taschenbuch
impression à la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 264 pp. Englisch. N° de réf. du vendeur 9783642433320

Contacter le vendeur

Acheter neuf

EUR 60,98
Autre devise
Frais de port : EUR 11
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Jiri Matousek
ISBN 10 : 3642433324 ISBN 13 : 9783642433320
Neuf Taschenbuch

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 264 pp. Englisch. N° de réf. du vendeur 9783642433320

Contacter le vendeur

Acheter neuf

EUR 60,98
Autre devise
Frais de port : EUR 15
De Allemagne vers France
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Gärtner, Bernd; Matousek, Jiri
Edité par Springer, 2014
ISBN 10 : 3642433324 ISBN 13 : 9783642433320
Neuf Couverture souple

Vendeur : California Books, Miami, FL, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur I-9783642433320

Contacter le vendeur

Acheter neuf

EUR 69,99
Autre devise
Frais de port : EUR 6,88
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Gärtner, Bernd; Matousek, Jiri
Edité par Springer, 2014
ISBN 10 : 3642433324 ISBN 13 : 9783642433320
Neuf Couverture souple

Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur 21002566-n

Contacter le vendeur

Acheter neuf

EUR 63,10
Autre devise
Frais de port : EUR 17,19
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Gärtner, Bernd; Matousek, Jiri
Edité par Springer, 2014
ISBN 10 : 3642433324 ISBN 13 : 9783642433320
Neuf Couverture souple

Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur 21002566-n

Contacter le vendeur

Acheter neuf

EUR 63,81
Autre devise
Frais de port : EUR 17,31
De Royaume-Uni vers France
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Jiri Matousek Bernd G?rtner
Edité par Springer, 2014
ISBN 10 : 3642433324 ISBN 13 : 9783642433320
Neuf Couverture souple

Vendeur : Books Puddle, New York, NY, Etats-Unis

Évaluation du vendeur 4 sur 5 étoiles Evaluation 4 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. pp. 264. N° de réf. du vendeur 26127755796

Contacter le vendeur

Acheter neuf

EUR 82,28
Autre devise
Frais de port : EUR 7,74
De Etats-Unis vers France
Destinations, frais et délais

Quantité disponible : 4 disponible(s)

Ajouter au panier

There are 7 autres exemplaires de ce livre sont disponibles

Afficher tous les résultats pour ce livre