Approximation Algorithms

Vijay V. Vazirani

57 valutazioni di Goodreads

Lingua: inglese

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

3540653678 / 9783540653677

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

Venditore con 5 stelle

Venditore AbeBooks dal 11 giugno 2025

Rilegato

Condizione: Nuovo

EUR 122,93

 Spedizione gratuita 
Spedito da Regno Unito a U.S.A.

Quantità: Più di 20 disponibili

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P?NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial-time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of approximation algorithms.This book is divided into three parts. Part I covers combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. Part II presents linear programming based algorithms. These are categorized under two fundamental techniques: rounding and the primal-dual schema. Part III covers four important topics: the first is the problem of finding a shortest vector in a lattice; the second is the approximability of counting, as opposed to optimization, problems; the third topic is centered around recent breakthrough results, establishing hardness of approximation for many key problems, and giving new legitimacy to approximation algorithms as a deep theory; and the fourth topic consists of the numerous open problems of this young field.This book is suitable for use in advanced undergraduate and graduate-level courses on approximation algorithms. An undergraduate course in algorithms and the theory of NP-completeness should suffice as a prerequisite for most of the chapters. This book can also be used as supplementary text in basic undergraduate and graduate algorithms courses.…

Codice articolo LU-9783540653677

Titolo
Approximation Algorithms
Autore
Vijay V. Vazirani
Editore
Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE
Anno di pubblicazione
2001
Condizione
New
Rilegatura
Hardback
Lingua
inglese
ISBN 10
3540653678
ISBN 13
9783540653677
Edizione
1st ed. 2001. Corr. 2nd printing 2002.
Dimensioni
16.31 x 2.74 x 24.38 cm

Rarewaves.com USA

London, London, Regno Unito

Venditore con 5 stelle

Venditore AbeBooks dal 11 giugno 2025

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

ArticoloDa 9 a 14 giorni lavorativiDa 9 a 14 giorni lavorativi
Primo articoloEUR 0,00EUR 0,00
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