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

67,90 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 2-3 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: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 518
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
Maße: 260 x 183 x 32 mm
Von/Mit: David P. Williamson (u. a.)
Erscheinungsdatum: 16.06.2011
Gewicht: 1,161 kg
preigu-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: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 518
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
Maße: 260 x 183 x 32 mm
Von/Mit: David P. Williamson (u. a.)
Erscheinungsdatum: 16.06.2011
Gewicht: 1,161 kg
preigu-id: 107223559
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte

Buch
Cover: 9780521513388 | Pearls of Functional Algorithm Design | Richard Bird | Buch | Englisch
Pearls of Functional Algorithm Design
EAN: 9780521513388
Sprache: Englisch
Von/Mit: Richard Bird

66,20 €*

Lieferzeit 2-3 Wochen

Taschenbuch
Cover: 9783827423498 | Mehr mathematische Rätsel für Liebhaber | Peter Winkler | Taschenbuch
Mehr mathematische Rätsel für Liebhaber
EAN: 9783827423498
Sprache: Deutsch
Von/Mit: Peter Winkler

23,20 €*

Lieferzeit 1-2 Werktage

Taschenbuch
Cover: 9783642446498 | Understanding Cryptography | A Textbook for Students and Practitioners
Understanding Cryptography
A Textbook for Students and Practitioners
EAN: 9783642446498
Sprache: Englisch
Von/Mit: Christof Paar (u. a.)

44,85 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9783834818553 | Einführung in die Kryptologie | Freiermuth | Taschenbuch | IX | 2014
Einführung in die Kryptologie
Lehrbuch für Unterricht und Selbststudium
EAN: 9783834818553
Sprache: Deutsch
Von/Mit: Karin Freiermuth (u. a.)

44,99 €*

Lieferzeit 4-7 Werktage

Taschenbuch
Cover: 9781449358655 | Doing Data Science | Cathy O'Neil (u. a.) | Taschenbuch | Englisch
Doing Data Science
EAN: 9781449358655
Sprache: Englisch
Von/Mit: Cathy O'Neil (u. a.)

50,30 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9780128046050 | An Introduction to Parallel Programming | Peter Pacheco (u. a.) | Buch
An Introduction to Parallel Programming
EAN: 9780128046050
Sprache: Englisch
Von/Mit: Matthew Malensek (u. a.)

84,10 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9781788834247 | Deep Reinforcement Learning Hands-On | Maxim Lapan | Taschenbuch
Deep Reinforcement Learning Hands-On
Apply modern RL methods, with deep Q-networks, value iteration, policy gradients, TRPO, AlphaGo Zero and more
EAN: 9781788834247
Sprache: Englisch
Von/Mit: Maxim Lapan

56,55 €*

Lieferzeit 1-2 Werktage

Taschenbuch
Cover: 9781032124841 | AI for Scientific Discovery | Janna Hastings | Taschenbuch | Englisch
AI for Scientific Discovery
EAN: 9781032124841
Sprache: Englisch
Von/Mit: Janna Hastings

36,55 €*

Lieferzeit 1-2 Wochen

Buch
Cover: 9780122063824 | Computability, Complexity, and Languages | Martin Davis (u. a.) | Buch
Computability, Complexity, and Languages
Fundamentals of Theoretical Computer Science
EAN: 9780122063824
Sprache: Englisch
Von/Mit: Martin Davis (u. a.)

53,55 €*

Lieferzeit 4-7 Werktage

Buch
Cover: 9781633438385 | Learn Concurrent Programming with Go | James Cutajar | Buch | Englisch
Learn Concurrent Programming with Go
EAN: 9781633438385
Von/Mit: James Cutajar

58,00 €*

Aktuell nicht verfügbar

Taschenbuch
Cover: 9780648635932 | Generative AI For Business Leaders | Complete Book Collection | Buch
Generative AI For Business Leaders
Complete Book Collection
EAN: 9780648635932
Sprache: Englisch
Von/Mit: I. Almeida

53,50 €*

Aktuell nicht verfügbar

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