Princeton University 
Computer Science
594


Week 1: Introduction, Set Cover 

Week 2: Bin Packing 

Week 3: Bin Packing contd. 

Week 4: Randomization: MAX SAT, MAX CUT for dense graphs 

Week 5: MAX CUT contd., Semidefinite programming 

Week 6: 

Week 7: 

Week 8: 

Week 9: 

Week 10: 

Week 11: 

Week 12: 
Homeworks
Michel Goeman's notes on Linear
Programming
(Read Sections 16 and 810).
David P. Williamson's lecture notes on Approximation Algorithms.
Lecture Notes
2/03/03 (ps,pdf) John White
2/05/03 (ps,pdf) Satyen Kale
2/10/03 (ps,pdf)
2/17/03 (ps,pdf)
Template for scribe notes. Sample LaTeX files (1.tex,2.tex,3.tex,4.tex,5.tex)
Last updated by Moses Charikar, 02Apr2003 02:49 PM