 S. Hoory, N. Linial , A. Wigderson,
Expander Graphs and their Applications
Bull. Amer. Math Soc., 43, pp 439561, 2006.
 D. Bertsimas and R. Vohra, Rounding Algorithms for Covering Problems, Mathematical Programming , 80 (1998) pp. 6389.
 David S. Johnson, The NPcompleteness column: The many
limits on approximation, ACM Transactions on Algorithms,
Volume 2 , Issue 3 (July 2006).
 Survey. M.X. Goemans and D.P. Williamson, The PrimalDual Method for
Approximation Algorithms and its Application to Network Design Problems,
in Approximation Algorithms, D. Hochbaum, Ed., 1997. [ ps
]
 New 3/4Approximation Algorithms for the Maximum Satisfiability Problem
, with Michel Goemans, SIAM Journal on Discrete Mathematics , 7:656666,
1994. [ps]
 D.B. Shmoys. "[Approximation algorithms for] Cut problems and
their application to divideandconquer". In: Approximation Algorithms
for NPhard Problems, (D.S. Hochbaum, ed.) PWS, 1997, 192235. [ ps
]

 Approximation
Algorithms for Network Problems by J.Cheriyan and R.Ravi, CMU.
 15859(M):
Randomized Algorithms, Anupam Gupta and Shuchi Chawla, CMU
(Fall 2004)

Approximation Algorithms, Anupam Gupta and R. Ravi, CMU (Fall
2005)
 Approximation
Algorithms by Leore Cowen, JHU.
 Randomization
and Optimization, Devdatt Dubhashi, Chalmers University of Technology
(2001)
 Approximation
Algorithms by Uri Zwick, Tel Aviv U.
 Combinatorial
Algorithms and Data Structures by Edith Cohen, Berkeley
 Approximation
Algorithms by David Shmoys and Eva Tardos, Cornell.

Approximation Algorithms by Yuval Rabani, Israel Inst. Tech.
 Approximability
of Optimization Problems by Madhu Sudan, MIT.
 Approximation
Algorithm Book Draft (gziped postscript) by Rajeev Motwani, Stanford.
 Advanced
Algorithms, Micheal Goemans, MIT.
 Homepage of Prof.
Alexander Schrijver, CWI.
