Free Computer, Mathematics, Technical Books and Lecture Notes, etc.
- Title The Design of Approximation Algorithms
- Author(s) David P. Williamson and David B. Shmoys
- Publisher: Cambridge University Press; 1 edition (April 30, 2011)
- Hardcover 500 pages
- eBook Online, PDF
- Language: English
- ISBN-10: 0521195276
- ISBN-13: 978-0521195270
- Share This:
Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. 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 part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.About the Authors
- 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, ORSA Journal on Computing, Mathematical Programming, and both the SIAM Journal of Computing and Journal of Discrete Mathematics; he also served as editor-in-chief for the latter.
- Algorithms and Data Structures
- Operations Research (OR), Linear Programming, Optimization, and Approximation
- Computational and Algorithmic Mathematics
- Computational Complexity
- Discrete Mathematics