
- Home
- Books
- Algorithms & Data Structures
- Core Algorithms
- The Design of Approximation Algorithms
The Design of Approximation Algorithms by David P. Williamson, David B. Shmoys develops algorithms that find provably near-optimal solutions to difficult optimization problems. The book connects mathematical models with the techniques used to design and analyze approximation guarantees. Examples show how to reason about solution quality when an exact method is computationally impractical, and how related problems can share a useful algorithmic approach.
What you will learn
- Prove approximation guarantees
- Apply linear-programming relaxations and rounding
- Use greedy, local-search and primal-dual techniques
Who this is for
Graduate students and researchers studying optimization algorithms. Algorithms, discrete mathematics and mathematical proofs are expected.


