More links shall be added as we go along ...
If you find any interesting links, please let me know.
[ Related papers/surveys ] [Similar Courses and Links] | [NP-Completeness] | [Lib] [Math]

Some related papers and surveys
  • S. Hoory, N. Linial , A. Wigderson, Expander Graphs and their Applications Bull. Amer. Math Soc., 43, pp 439--561, 2006.
  • D. Bertsimas and R. Vohra, Rounding Algorithms for Covering Problems, Mathematical Programming , 80 (1998) pp. 63-89.
  • David S. Johnson, The NP-completeness 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 Primal-Dual Method for Approximation Algorithms and its Application to Network Design Problems, in Approximation Algorithms, D. Hochbaum, Ed., 1997. [ ps ]
  • New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem , with Michel Goemans, SIAM Journal on Discrete Mathematics , 7:656-666, 1994. [ps]
  • D.B. Shmoys. "[Approximation algorithms for] Cut problems and their application to divide-and-conquer". In: Approximation Algorithms for NP-hard Problems, (D.S. Hochbaum, ed.) PWS, 1997, 192-235. [ ps ]
Similar Courses (possibly include lecture notes) and Links
NP-Completeness Related Links
Algorithms & Data Structures Implementations & Libraries
Related Mathematics Links

Home | Announcements | Schedule | Assignments | Syllabus | Lecture Notes