The Design of Approximation Algorithms
David B. (Cornell University, New York) Shmoys, David P. (Cornell University, New York) Williamson
Cambridge University Press, 2011
101,25 €On orderDelivery: 2-3 weeks
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.
- ISBN-13
- 9780521195270
- ISBN-10
- 0521195276
- Publisher
- Cambridge University Press
- Year
- 2011
- Publication date
- 2011-04-26
- Pages
- 518
- Dimensions
- 256x186x32
- Weight
- 1104