CMSC 451 (Spring 2009)
Samir Khuller
I will be teaching CMSC 451 in Sp 2009, our senior-level algorithms
course. This course is typically a bit more advanced than typical
undergraduate algorithms courses offered at most Universities and
might interest graduate students as well. The main reason for this
is that we have a sequence of two algorithms courses -- 351 and 451.
The book I am planning on using is called "Algorithm Design" by
Kleinberg and Tardos. It is an excellent textbook, covering all
of the material we will cover (greedy algorithms, dynamic programming,
network flows, NP-completeness etc.) in a very elegant way.
The web page is not ready, but you can take a look at the web page
for the class for Fall 2008 (Carl Kingsford is teaching it this semester).
MS students can earn credit for this course and use the credits towards
their 30 credit requirement. While this is not a Ph.D. core course, it
is a useful course to take if you are planning on taking any of the
advanced algorithms courses later on (Ph.D. students can also use
this class towards the 30 cr requirements if they wish to earn an MS
degree along the way).
The class is offered TuTh 9:30-10:45am and will have homeworks and exams
(no project).
samir
