Zur Startseite gehen
0,00 €*
Cover: 9780521195270 | The Design of Approximation Algorithms | David P. Williamson (u. a.)
Dekorationsartikel gehören nicht zum Leistungsumfang.
The Design of Approximation Algorithms
Buch von David P. Williamson (u. a.)
Sprache: Englisch

74,20 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Kategorien:
Beschreibung
Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions.
Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions.
Über den Autor
David P. Williamson is a Professor at Cornell University with a joint appointment in the School of Operations Research and Information Engineering and in the Department of Information Science. Prior to joining Cornell, he was a Research Staff Member at the IBM T. J. Watson Research Center and a Senior Manager at the IBM Almaden Research Center. He has won several awards for his work on approximation algorithms, including the 2000 Fulkerson Prize, sponsored by the American Mathematical Society and the Mathematical Programming Society. He has served on several editorial boards, including ACM Transactions on Algorithms, Mathematics of Operations Research, the SIAM Journal on Computing and the SIAM Journal on Discrete Mathematics.
Inhaltsverzeichnis
Part I. An Introduction to the Techniques: 1. An introduction to approximation algorithms; 2. Greedy algorithms and local search; 3. Rounding data and dynamic programming; 4. Deterministic rounding of linear programs; 5. Random sampling and randomized rounding of linear programs; 6. Randomized rounding of semidefinite programs; 7. The primal-dual method; 8. Cuts and metrics; Part II. Further Uses of the Techniques: 9. Further uses of greedy and local search algorithms; 10. Further uses of rounding data and dynamic programming; 11. Further uses of deterministic rounding of linear programs; 12. Further uses of random sampling and randomized rounding of linear programs; 13. Further uses of randomized rounding of semidefinite programs; 14. Further uses of the primal-dual method; 15. Further uses of cuts and metrics; 16. Techniques in proving the hardness of approximation; 17. Open problems; Appendix A. Linear programming; Appendix B. NP-completeness.
Details
Erscheinungsjahr: 2011
Fachbereich: Programmiersprachen
Genre: Importe, Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
ISBN-13: 9780521195270
ISBN-10: 0521195276
Sprache: Englisch
Ausstattung / Beilage: HC gerader Rücken kaschiert
Einband: Gebunden
Autor: Williamson, David P.
Shmoys, David B.
Hersteller: Cambridge University Press
Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de
Maße: 260 x 183 x 32 mm
Von/Mit: David P. Williamson (u. a.)
Erscheinungsdatum: 16.06.2011
Gewicht: 1,161 kg
Artikel-ID: 107223559
Über den Autor
David P. Williamson is a Professor at Cornell University with a joint appointment in the School of Operations Research and Information Engineering and in the Department of Information Science. Prior to joining Cornell, he was a Research Staff Member at the IBM T. J. Watson Research Center and a Senior Manager at the IBM Almaden Research Center. He has won several awards for his work on approximation algorithms, including the 2000 Fulkerson Prize, sponsored by the American Mathematical Society and the Mathematical Programming Society. He has served on several editorial boards, including ACM Transactions on Algorithms, Mathematics of Operations Research, the SIAM Journal on Computing and the SIAM Journal on Discrete Mathematics.
Inhaltsverzeichnis
Part I. An Introduction to the Techniques: 1. An introduction to approximation algorithms; 2. Greedy algorithms and local search; 3. Rounding data and dynamic programming; 4. Deterministic rounding of linear programs; 5. Random sampling and randomized rounding of linear programs; 6. Randomized rounding of semidefinite programs; 7. The primal-dual method; 8. Cuts and metrics; Part II. Further Uses of the Techniques: 9. Further uses of greedy and local search algorithms; 10. Further uses of rounding data and dynamic programming; 11. Further uses of deterministic rounding of linear programs; 12. Further uses of random sampling and randomized rounding of linear programs; 13. Further uses of randomized rounding of semidefinite programs; 14. Further uses of the primal-dual method; 15. Further uses of cuts and metrics; 16. Techniques in proving the hardness of approximation; 17. Open problems; Appendix A. Linear programming; Appendix B. NP-completeness.
Details
Erscheinungsjahr: 2011
Fachbereich: Programmiersprachen
Genre: Importe, Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
ISBN-13: 9780521195270
ISBN-10: 0521195276
Sprache: Englisch
Ausstattung / Beilage: HC gerader Rücken kaschiert
Einband: Gebunden
Autor: Williamson, David P.
Shmoys, David B.
Hersteller: Cambridge University Press
Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de
Maße: 260 x 183 x 32 mm
Von/Mit: David P. Williamson (u. a.)
Erscheinungsdatum: 16.06.2011
Gewicht: 1,161 kg
Artikel-ID: 107223559
Sicherheitshinweis

Ähnliche Produkte

Ähnliche Produkte

Taschenbuch
Cover: 9781449303716 | Machine Learning for Hackers | Drew Conway | Taschenbuch | 305 S.
Machine Learning for Hackers
EAN: 9781449303716
Sprache: Englisch
Von/Mit: Drew Conway

49,30 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9783662500828 | The Cinderella.2 Manual | Ulrich H. Kortenkamp (u. a.) | Taschenbuch
The Cinderella.2 Manual
Working with The Interactive Geometry Software
EAN: 9783662500828
Sprache: Englisch
Von/Mit: Ulrich H. Kortenkamp (u. a.)

46,95 €*

Lieferzeit 4-7 Werktage

Taschenbuch
Cover: 9781484249222 | C++17 Standard Library Quick Reference | Marc Gregoire (u. a.) | Buch
C++17 Standard Library Quick Reference
A Pocket Guide to Data Structures, Algorithms, and Functions
EAN: 9781484249222
Sprache: Englisch
Von/Mit: Marc Gregoire (u. a.)

41,60 €*

Lieferzeit 2-4 Werktage

Taschenbuch
Cover: 9783030084868 | Practical Mathematical Optimization | Daniel N Wilke (u. a.) | Buch
Practical Mathematical Optimization
Basic Optimization Theory and Gradient-Based Algorithms
EAN: 9783030084868
Sprache: Englisch
Von/Mit: Daniel N Wilke (u. a.)

74,10 €*

Lieferzeit 2-4 Werktage

Taschenbuch
Cover: 9783658297787 | Data Analytics | Models and Algorithms for Intelligent Data Analysis
Data Analytics
Models and Algorithms for Intelligent Data Analysis
EAN: 9783658297787
Sprache: Englisch
Von/Mit: Thomas A. Runkler

61,85 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9781108741774 | Algorithms for Convex Optimization | Nisheeth K. Vishnoi | Taschenbuch
Algorithms for Convex Optimization
EAN: 9781108741774
Sprache: Englisch
Von/Mit: Nisheeth K. Vishnoi

51,20 €*

Lieferzeit 1-2 Wochen

Buch
Cover: 9780674975231 | A History of Data Visualization and Graphic Communication | Buch
A History of Data Visualization and Graphic Communication
EAN: 9780674975231
Sprache: Englisch
Von/Mit: Michael Friendly (u. a.)

63,95 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9780367350208 | Exercises in Programming Style | Cristina Videira Lopes | Taschenbuch
Exercises in Programming Style
EAN: 9780367350208
Sprache: Englisch
Von/Mit: Cristina Videira Lopes

43,55 €*

Lieferzeit 4-7 Werktage

Taschenbuch
Cover: 9783031007453 | On Transactional Concurrency Control | Goetz Graefe | Taschenbuch
On Transactional Concurrency Control
EAN: 9783031007453
Sprache: Englisch
Von/Mit: Goetz Graefe

68,95 €*

Lieferzeit 2-4 Werktage

Taschenbuch
Cover: 9783658398545 | Optimierungsmethoden | Ralf Hollstein | Taschenbuch | Paperback | xxii
Optimierungsmethoden
Einführung in die klassischen, naturanalogen und neuronalen Optimierungen
EAN: 9783658398545
Sprache: Deutsch
Von/Mit: Ralf Hollstein

54,99 €*

Lieferzeit 2-4 Werktage

Diese Website verwendet Cookies, um eine bestmögliche Erfahrung bieten zu können. Mehr Informationen ...