Williamson & Shmoys. The Design of Approximation Algorithms
It includes greedy, local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Dinitz. Approximation Algorithms. Johns Hopkins cs.jhu.edu
It includes greedy, local search, dynamic programming, randomized rounding, tree embeddings, and semidefinite programming.
-
Gupta & Ravi. Approximation Algorithms. CMU cs.cmu.edu
It includes convex programming-based, randomness, and metric methods.
-
Du & Ko. Design and Analysis of Approximation Algorithms u.pcloud.link
A technique-oriented approach provides a unified view. It includes detailed algorithms, proofs, analyses, examples, and applications from research papers.
-
Vijay Vazirani. Approximation Algorithms u.pcloud.link
-
Chekuri. Approximation Algorithmis Illinois courses.engr.illinois.edu
A broad introduction to results and techniques with an emphasis on fundamental problems and widely applicable tools. Also more advanced and specialized topics.
-
Arora. Advanced Algorithm Design cs.princeton.edu
Notably uses ideas such as randomness, approximation, high dimensional geometry. Faces uncertainty, approaches to handle big data, handling intractability, heuristic approaches, ..etc.
Theoretical Computer Science › Approximation > Books: “It includes greedy, local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.”