(Last modification: 2012-12-17)
Textbooks:
(1) David Williamson, David Shmoys. The Design of Approximation Algorithms, Cambridge University Press, 2011.
(2) Vijay Vazirani. Apporoximation Algorithms. Springer, 2001.
(3) Rajeev Motwani, Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
Ch-01 - Introduction -- basics of complexity and approximation [pdf]
Ch-02 - Greedy and local search -- Set Cover, Min Makespan, TSP [pdf]
Ch-03 - Rounding data and dynamic programming -- Knapsack, Min Makespan [pdf]
Ch-04 - Deterministic rounding of LP -- Set Cover, UFL, Steiner Tree [pdf]
Ch-05 - Random sampling and randomized rounding -- Set Cover, MAX SAT, UFL [pdf]
Ch-06 - Randomized rounding of semidefinite program -- Max Cut [pdf]
Ch-07 - Primal-dual algorithms -- Set Cover, Steiner Forest, Steiner Tree [pdf]
Ch-A1 - Prize-collecting Steiner Tree [pdf]
Classes:
(2) Fall, 2012.
(1) Spring, 2012.
from: http://blog.sciencenet.cn/blog-482332-537144.html