Gupta & Ravi. Approximation Algorithms. CMU
It includes convex programming-based, randomness, and metric methods.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Vijay Vazirani. Approximation Algorithms u.pcloud.link
-
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.
-
Aspnes. Notes on Randomized Algorithms cs.yale.edu
Supplemental notes to the standard books by Mitzenmacher & Upfals, and Motwani & Raghavan.
-
Gregory Valiant. The Modern Algorithmic Toolbox. Stanford web.stanford.edu
It covers hashing, dimension reduction, linear and convex programming, gradient descent and regression, sampling and estimation, compressive sensing, linear-algebraic techniques (principal components analysis, singular value decomposition, spectral techniques), and an intro to…
-
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.
Theoretical Computer Science › Approximation > Lecture Notes: “It includes convex programming-based, randomness, and metric methods.”