The Design of Approximation Algorithms

Valutazione media 4,44
( su 9 valutazioni fornite da GoodReads )
 
9780521195270: The Design of Approximation Algorithms

Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Recensione:

"This is a beautifully written book that will bring anyone who reads it to the current frontiers of research in approximation algorithms. It covers everything from the classics to the latest, most exciting results such as ARV’s sparsest cut algorithm, and does so in an extraordinarily clear, rigorous and intuitive manner."
Anna Karlin, University of Washington

"The authors of this book are leading experts in the area of approximation algorithms. They do a wonderful job in providing clear and unified explanations of subjects ranging from basic and fundamental algorithmic design techniques to advanced results in the forefront of current research. This book will be very valuable to students and researchers alike."
Uriel Feige, Professor of Computer Science and Applied Mathematics, the Weizmann Institute

"Theory of approximation algorithms is one of the most exciting areas in theoretical computer science and operations research. This book, written by two leading researchers, systematically covers all the important ideas needed to design effective approximation algorithms. The description is lucid, extensive and up-to-date. This will become a standard textbook in this area for graduate students and researchers."
Toshihide Ibaraki, The Kyoto College of Graduate Studies for Informatics

"This book on approximation algorithms is a beautiful example of an ideal textbook. It gives a concise treatment of the major techniques, results and references in approximation algorithms and provides an extensive and systematic coverage of this topic up to the frontier of current research. It will become a standard textbook and reference for graduate students, teachers and researchers in the field."
Rolf H. Möhring, Technische Universität Berlin

"I have fond memories of learning approximation algorithms from an embryonic version of this book. The reader can expect a clearly written and thorough tour of all the important paradigms for designing efficient heuristics with provable performance guarantees for combinatorial optimization problems."
Tim Roughgarden, Stanford University

"This book is very well written. It could serve as a textbook on the design of approximation algorithms for discrete optimization problems. Readers will enjoy the clear and precise explanation of modern concepts, and the results obtained in this very elegant theory. Solving the exercises will benefit all readers interested in gaining a deeper understanding of the methods and results in the approximate algorithms for discrete optimization area."
Alexander Kreinin, Computing Reviews

"Any researcher interested in approximation algorithms would benefit greatly from this new book by Williamson and Schmoys. It is an ideal starting point for the fresh graduate student, as well as an excellent reference for the experts in the field. The wrting style is very clear and lucid, and it was a pleasure reading and reviewing this book."
Deeparnab Chakrabarty for SIGACT News

"The structure of the book is very interesting and allows a deeper understanding of the techniques presented. The whole book manages to develop a way of analyzing approximation algorithms and of designing approximation algorithms that perform well."
Dana Simian, Mathematical Reviews

Descrizione del libro:

Designed as a textbook for graduate courses on algorithms, this book will also serve as a reference for researchers interested in heuristic solutions of discrete optimization problems. It presents central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

I migliori risultati di ricerca su AbeBooks

1.

David P. Williamson, David B. Shmoys
Editore: CAMBRIDGE UNIVERSITY PRESS, United Kingdom (2014)
ISBN 10: 0521195276 ISBN 13: 9780521195270
Nuovi Rilegato Quantità: 1
Da
The Book Depository
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 2014. Hardback. Condizione libro: New. 257 x 180 mm. Language: English . Brand New Book. Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems. Codice libro della libreria AAZ9780521195270

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 48,68
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

2.

David P. Williamson, David B. Shmoys
Editore: Cambridge University Press 2011-04-26, Cambridge (2011)
ISBN 10: 0521195276 ISBN 13: 9780521195270
Nuovi Rilegato Quantità: 10
Da
Blackwell's
(Oxford, OX, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Cambridge University Press 2011-04-26, Cambridge, 2011. hardback. Condizione libro: New. Codice libro della libreria 9780521195270

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 46,17
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 5,38
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

3.

Williamson, David P., Shmoys, David B.
Editore: Cambridge University Press (2011)
ISBN 10: 0521195276 ISBN 13: 9780521195270
Nuovi Rilegato Prima edizione Quantità: 1
Valutazione libreria
[?]

Descrizione libro Cambridge University Press, 2011. Condizione libro: New. 2011. 1st Edition. Hardcover. Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions. Num Pages: 518 pages, 86 b/w illus. 121 exercises. BIC Classification: PBU; UMB; UMZ. Category: (U) Tertiary Education (US: College). Dimension: 256 x 186 x 32. Weight in Grams: 1154. 516 pages, 86 b/w illus. 121 exercises. Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions. Cateogry: (U) Tertiary Education (US: College). BIC Classification: PBU; UMB; UMZ. Dimension: 256 x 186 x 32. Weight: 1086. . . . . . . Codice libro della libreria V9780521195270

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 51,67
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Irlanda a: U.S.A.
Destinazione, tempi e costi

4.

David P. Williamson, David B. Shmoys
Editore: CAMBRIDGE UNIVERSITY PRESS, United Kingdom (2014)
ISBN 10: 0521195276 ISBN 13: 9780521195270
Nuovi Rilegato Quantità: 1
Da
The Book Depository US
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 2014. Hardback. Condizione libro: New. 257 x 180 mm. Language: English . Brand New Book. Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems. Codice libro della libreria AAZ9780521195270

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 53,08
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

5.

Williamson, David P.
Editore: Cambridge University Press (2011)
ISBN 10: 0521195276 ISBN 13: 9780521195270
Nuovi Quantità: 3
Da
Books2Anywhere
(Fairford, GLOS, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Cambridge University Press, 2011. HRD. Condizione libro: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Codice libro della libreria GB-9780521195270

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 43,26
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 10,75
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

6.

David P. Williamson, David B. Shmoys
Editore: Cambridge University Press
ISBN 10: 0521195276 ISBN 13: 9780521195270
Nuovi Rilegato Quantità: 4
Da
THE SAINT BOOKSTORE
(Southport, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Cambridge University Press. Hardback. Condizione libro: new. BRAND NEW, The Design of Approximation Algorithms, David P. Williamson, David B. Shmoys, Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems. Codice libro della libreria B9780521195270

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 47,22
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 7,10
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

7.

Williamson, David P., Shmoys, David B.
Editore: Cambridge University Press
ISBN 10: 0521195276 ISBN 13: 9780521195270
Nuovi Rilegato Quantità: 1
Da
Kennys Bookstore
(Olney, MD, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Cambridge University Press. Condizione libro: New. 2011. 1st Edition. Hardcover. Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions. Num Pages: 518 pages, 86 b/w illus. 121 exercises. BIC Classification: PBU; UMB; UMZ. Category: (U) Tertiary Education (US: College). Dimension: 256 x 186 x 32. Weight in Grams: 1154. 516 pages, 86 b/w illus. 121 exercises. Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions. Cateogry: (U) Tertiary Education (US: College). BIC Classification: PBU; UMB; UMZ. Dimension: 256 x 186 x 32. Weight: 1086. . . . . . Books ship from the US and Ireland. Codice libro della libreria V9780521195270

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 55,16
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi

8.

Williamson, David P.; Shmoys, David B.
Editore: Cambridge University Press (2011)
ISBN 10: 0521195276 ISBN 13: 9780521195270
Nuovi Rilegato Quantità: 4
Da
Ria Christie Collections
(Uxbridge, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Cambridge University Press, 2011. Condizione libro: New. book. Codice libro della libreria ria9780521195270_rkm

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 51,66
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,97
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

9.

Williamson, David P.; Shmoys, David B.
ISBN 10: 0521195276 ISBN 13: 9780521195270
Nuovi Quantità: 1
Da
BWB
(Valley Stream, NY, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Condizione libro: New. Depending on your location, this item may ship from the US or UK. Codice libro della libreria 97805211952700000000

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 55,85
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi

10.

Williamson, David P.; Shmoys, David B.
ISBN 10: 0521195276 ISBN 13: 9780521195270
Nuovi Quantità: 3
Da
Speedy Hen LLC
(Sunrise, FL, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Condizione libro: New. Bookseller Inventory # ST0521195276. Codice libro della libreria ST0521195276

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 56,69
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi

Vedi altre copie di questo libro

Vedi tutti i risultati per questo libro