Du & Ko. Design and Analysis of Approximation Algorithms
A technique-oriented approach provides a unified view. It includes detailed algorithms, proofs, analyses, examples, and applications from research papers.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Williamson & Shmoys. The Design of Approximation Algorithms designofapproxalgs.com
It includes greedy, local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.
-
Dinitz. Approximation Algorithms. Johns Hopkins cs.jhu.edu
It includes greedy, local search, dynamic programming, randomized rounding, tree embeddings, and semidefinite programming.
-
Vijay Vazirani. Approximation Algorithms u.pcloud.link
-
Gupta & Ravi. Approximation Algorithms. CMU cs.cmu.edu
It includes convex programming-based, randomness, and metric methods.
-
Kelner. Topics in Theoretical Computer Science: An Algorithmist's Toolkit. MIT ocw.mit.edu
It covers a collection of geometric techniques that apply broadly in modern algorithm design.
-
Design and Analysis of Algorithms, 2015 ocw.mit.edu
Theoretical Computer Science › Approximation > Books: “A technique-oriented approach provides a unified view. It includes detailed algorithms, proofs, analyses, examples, and applications from research papers.”