Verwandte Artikel zu The Design of Approximation Algorithms Hardback
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorinnen und Autoren
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.
David Shmoys has faculty appointments in both the School of Operations Research and Information Engineering and the Department of Computer Science, and he is currently Associate Director of the Institute for Computational Sustainability at Cornell University. He is a Fellow of the ACM, was an NSF Presidential Young Investigator, and has served on numerous editorial boards, including Mathematics of Operations Research (for which he is currently an associate editor), Operations Research, the ORSA Journal on Computing, Mathematical Programming and both the SIAM Journal on Computing and the SIAM Journal on Discrete Mathematics; he also served as editor-in-chief for the latter.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 35,82
EUR 13,85 für den Versand von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 77,78
EUR 5,77 für den Versand von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & DauerSuchergebnisse für The Design of Approximation Algorithms Hardback
Beispielbild für diese ISBN
The Design of Approximation Algorithms
Verlag:
Cambridge University Press, 2011
ISBN 10: 0521195276
ISBN 13: 9780521195270
Gebraucht
Hardcover
Erstausgabe
Anbieter: Prior Books Ltd, Cheltenham, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Like New. First Edition. A firm, square and tight hardback with strong joints, just showing a few very bumps and some mild cosmetic wear. Hence a non-text page is stamped 'damaged'. Despite such this book is actually in nearly new condition. Thus the contents are crisp, fresh and clean with no pen-marks. Not from a library so no such stamps or labels. Now offered for sale at a very reasonable price. Artikel-Nr. 209280
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
The Design of Approximation Algorithms
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Artikel-Nr. ria9780521195270_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
The Design of Approximation Algorithms
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. pp. xi + 504 Illus. Artikel-Nr. 5369144
Anzahl: 1 verfügbar
Foto des Verkäufers
The Design of Approximation Algorithms
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Artikel-Nr. 9780521195270
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
The Design of Approximation Algorithms
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Brand New. 1st edition. 500 pages. 10.10x7.10x1.30 inches. In Stock. Artikel-Nr. x-0521195276
Anzahl: 2 verfügbar