The Design of Approximation Algorithms

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.

• | By (Author): David P. Williamson (Cornell University, New York), David B. Shmoys (Cornell University, New York) (Author)
• | Publisher: Cambridge University Press
• | Publication Date: Apr 26, 2011
• | Country of Publication: United Kingdom
• | Number of Pages: 518 pages
• | Language: NULL
• | Binding: Hardback
• | ISBN-10: 0521195276
• | ISBN-13: 9780521195270