Approximation Algorithms and Semidefinite Programming - Couverture rigide

G�rtner, Bernd; Matousek, Jiri

9783642220142: Approximation Algorithms and Semidefinite Programming

Couverture rigide

ISBN 10 : 3642220142 ISBN 13 : 9783642220142

Editeur : Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 2012

Afficher les exemplaires de cette �dition comportant l?ISBN

1 D'occasion

De EUR 137,80

9 Neuf

De EUR 72,89

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.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteur: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Date d'�dition: 2012
Langue: anglais
ISBN 10: 3642220142
ISBN 13: 9783642220142
Reliure: Reli�
Nombre de pages: 251
Coordonn�es du fabricant: non disponible
Personne responsable: CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Allemagne

Acheter D'occasion

�tat : Comme neuf

Like New

Afficher cet article

EUR 137,80

Autre devise

EUR 28,83 exp�dition depuis Royaume-Uni vers France

Destinations, frais et d�lais

Ajouter au panier

Acheter neuf

Afficher cet article

EUR 72,89

Autre devise

EUR 9,70 exp�dition depuis Allemagne vers France

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9783642433320: Approximation Algorithms and Semidefinite Programming

Edition pr�sent�e

ISBN 10 : 3642433324 ISBN 13 : 9783642433320
Editeur : Springer, 2014
Couverture souple

Springer, 2012 (Couverture souple)

R�sultats de recherche pour Approximation Algorithms and Semidefinite Programming

Image fournie par le vendeur

Approximation Algorithms and Semidefinite Programming

Bernd G�rtner|Jiri Matousek

Edit� par Springer Berlin Heidelberg, 2012

ISBN 10 : 3642220142 ISBN 13 : 9783642220142

Neuf Couverture rigide

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Gebunden. 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 5052742

Contacter le vendeur

Acheter neuf

EUR 72,89

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

Approximation Algorithms and Semidefinite Programming

G�rtner, Bernd; Matousek, Jiri

Edit� par Springer, 2012

ISBN 10 : 3642220142 ISBN 13 : 9783642220142

Neuf Couverture rigide

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Etat : New. In English. N� de r�f. du vendeur ria9783642220142_new

Contacter le vendeur

Acheter neuf

EUR 91,25

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 fournie par le vendeur

Approximation Algorithms and Semidefinite Programming

Jiri Matousek

Edit� par Springer Berlin Heidelberg, 2012

ISBN 10 : 3642220142 ISBN 13 : 9783642220142

Neuf Couverture rigide

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. 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 9783642220142

Contacter le vendeur

Acheter neuf

EUR 85,59

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

Approximation Algorithms and Semidefinite Programming

Jiri Matousek

Edit� par Springer Berlin Heidelberg Jan 2012, 2012

ISBN 10 : 3642220142 ISBN 13 : 9783642220142

Neuf Couverture rigide

impression � la demande

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

�valuation du vendeur 5 sur 5 �toiles

Buch. 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 9783642220142

Contacter le vendeur

Acheter neuf

EUR 85,59

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

Approximation Algorithms and Semidefinite Programming

Jiri Matousek

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Jan 2012, 2012

ISBN 10 : 3642220142 ISBN 13 : 9783642220142

Neuf Couverture rigide

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. 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 9783642220142

Contacter le vendeur