CS573 - Graduate Algorithms - Fall 2009

Schedule and Lecture Notes


This is a tentative course outline. Lecture topics are subject to change. Exam dates are not.
You may want to check out previous semester course notes.
Here are previous semesters course pages: spring06, spring07.
Wed 8/26 1: NP Completeness I
Fri 8/28 2: NP Completeness II
Wed 9/2 3: NP Completeness III
Fri 9/4 4: Dynamic Programming
Wed 9/9 5: Even MORE Dynamic Programming
Fri 9/11 6: Approximation algs I
Wed 9/16 7: Approximation algs II
Fri 9/18 8: Approximation algs III
Wed 9/23 9: Randomized Algorithms I
Fri 9/25 10: Randomized Algorithms II
Wed 9/30 11: Rand Alg III - Min Cut
Fri 10/2 12: Network Flow I
Wed 10/7 Midterm
Fri 10/9 13: Network Flow II
Wed 10/14 14: Network Flow III
Fri 10/16 15: Network Flow IV
Wed 10/21 16: Mincost flow
Fri 10/23 17: Mincost flow II
Wed 10/28 18: Fast Fourier Transform
Fri 10/30 19: Sorting Networks
Wed 11/4 20: Linear Programming
Fri 11/6 21: Linear Programming II
Wed 11/11 22: Linear Programming III
Fri 11/13 23: Max cut
Wed 11/18 24: Learning
Fri 11/20 25: Huffman coding
Wed 11/25 Thanksgiving Vacation
Fri 11/27 Thanksgiving Vacation
Wed 12/2 26: Entropy
Fri 12/4 27: Entropy
Wed 12/9 28: Shannon's theorem
Tue 12/15 Final: exam 7-10, Tuesday, Dec. 15

Last modified: Thu Aug 27 13:41:23 CDT 2009