The Design of Approximation Algorithms - Couverture rigide

Williamson, David P.; Shmoys, David B.

Couverture rigide

ISBN 10 : 0521195276 ISBN 13 : 9780521195270

Editeur : Cambridge University Press, 2011

Synopsis

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.

A propos du livre

À propos des auteurs

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.

Détails de l'édition

• Éditeur: Cambridge University Press
• Date d'édition: 2011
• Langue: anglais
• ISBN 10: 0521195276
• ISBN 13: 9780521195270
• Reliure: Relié
• Numéro d'édition: 1
• Nombre de pages: 518
• Coordonnées du fabricant: Cambridge University Press; https://www.cambridge.org/; ; Via Honduras,15; Pomezia; Italia; 71; Italie