Approximation Algorithms and Semidefinite Programming

Lingua: inglese

Editore: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2012

3642220142 / 9783642220142

Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK

Venditore con 5 stelle

Venditore AbeBooks dal 11 giugno 2025

Visualizza gli articoli di questo venditore
Rilegato

Condizione: Nuovo

EUR 115,53

EUR 75,78 spedizione 
Spedito da Regno Unito a U.S.A.

Quantità: Più di 20 disponibili

Aggiungi al carrello

Descrizione dell’articolo da parte del venditore

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.

Codice articolo LU-9783642220142

Titolo
Approximation Algorithms and Semidefinite Programming
Autore
Jiri Matousek, Bernd Gärtner
Editore
Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE
Anno di pubblicazione
2012
Condizione
New
Rilegatura
Hardback
Lingua
inglese
ISBN 10
3642220142
ISBN 13
9783642220142
Edizione
2012.

Rarewaves.com UK

London, Regno Unito

Venditore con 5 stelle

Venditore AbeBooks dal 11 giugno 2025

Tariffe di spedizione da Regno Unito a U.S.A.

ArticoloDa 60 a 60 giorni lavorativiDa 60 a 60 giorni lavorativi
Primo articoloEUR 75,78EUR 116,59
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Informazioni sull’azienda del venditore

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, Regno Unito W1W 8BE