cambridge university press
The Design of Approximation Algorithms
Lowest observed price
Prices at stores
1 offerPrices are the most recently observed prices. Check the current price, availability and delivery costs at the store.
Price history
2 price observationsThe chart shows the lowest recorded product price on each observation day. Prices between observations have not been verified.
- Lowest observed
- €78.50
- Highest observed
- €96.30
- Latest history observation
Show all 2 price observations
| Price observed (Finnish time) | Price |
|---|---|
| €96.30 | |
| €78.50 |
Product details
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
- Brand
- cambridge university press
- EAN / GTIN
- 9780521195270