Tell your friends about this item:
The Design of Approximation Algorithms Williamson, David P. (Cornell University, New York)
Do you have a profile? Log in
Get notified about new Williamson, David P. (Cornell University, New York) releases
Add to your iMusic wish list
The Design of Approximation Algorithms
Williamson, David P. (Cornell University, New York)
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.
516 pages, 86 b/w illus. 121 exercises
| Media | Books Hardcover Book (Book with hard spine and cover) |
| Released | April 26, 2011 |
| ISBN13 | 9780521195270 |
| Publishers | Cambridge University Press |
| Pages | 518 |
| Dimensions | 186 × 256 × 32 mm · 1.10 kg |
| Language | English |