This is the web page for the class when it was taught in Fall 1999. I will have the TA make a new (and better) web page for the class in Spring 2002..
Instructor: Samir Khuller Office: AVW 3217. Office phone: (301) 405--6765. E-mail: firstname.lastname@example.org.
Office Hours: Thu 11-12. If you cannot make these hours, please make an appointment to see me at a different time.
I will update this page every week during the semester. I will place all homeworks as well as solutions to homeworks here. If you have any trouble accessing them, please let me know. These are in postscript.
Class Time: TuTh 11:00--12:15. CLB 0109.
MIDTERM WILL BE ON MONDAY IN CLASS, OCTOBER 25th. CLOSED BOOKS, CLOSED NOTES
Course Overview: The main paradigm in the course will be the design and analysis of algorithms for discrete optimization problems. A majority of the problems considered will be graph theoretic. I expect that the students are already familiar with the material from CMSC 451 (minimum spanning trees, shortest paths, dynamic programming, NP-completeness etc.).
Course work will consist of homeworks, a midterm and a final exam.
Grading: The relative weights of these will be 20% for the homeworks, 35% for the midterm and 45% for the final exam.
Approximation Compendium .
Notes will be put online only after the lecture. From my web page you can get the entire set of lecture notes from when I taught the course in 1996.