Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 58,73
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 70,08
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 64,64
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 63,00
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 64,63
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 95,80
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 88,44
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In English.
Idioma: Inglés
Publicado por Springer, Springer Gabler, 2014
ISBN 10: 3642433324 ISBN 13: 9783642433320
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 60,98
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
EUR 55,25
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Approximation Algorithms and Semidefinite Programming | Bernd Gärtner (u. a.) | Taschenbuch | xi | Englisch | 2014 | Springer | EAN 9783642433320 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 119,02
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 109,51
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 126,73
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 2012 edition. 262 pages. 9.25x6.00x1.00 inches. In Stock.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 140,21
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Springer, Springer Vieweg, 2012
ISBN 10: 3642220142 ISBN 13: 9783642220142
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 85,59
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: 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.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 139,27
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2014
ISBN 10: 3642433324 ISBN 13: 9783642433320
Librería: moluna, Greven, Alemania
EUR 53,22
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: 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.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2012
ISBN 10: 3642220142 ISBN 13: 9783642220142
Librería: moluna, Greven, Alemania
EUR 72,89
Cantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: 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.
Librería: preigu, Osnabrück, Alemania
EUR 75,65
Cantidad disponible: 5 disponibles
Añadir al carritoBuch. Condición: Neu. Approximation Algorithms and Semidefinite Programming | Bernd Gärtner (u. a.) | Buch | xi | Englisch | 2012 | Springer | EAN 9783642220142 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.