CS573 - Algorithms - Fall 2013

Schedule and Lecture Notes


This is a tentative course outline. Lecture topics are subject to change. Exam dates are not.
The class notes in one big file. (Class notes are going to be updated during the semester.)
Tue 8/27 1: NP Completeness I (slides/h/n)
Thu 8/29 2: NP Completeness II (slides/h/n)
Tue 9/3 3: NP Completeness III (slides/h/n)
Thu 9/5       (slides/h/n)
Tue 9/10 4: Dynamic Programming (slides/h/n)
Thu 9/12 5: Even MORE Dynamic Programming (slides/h/n)
Tue 9/17 6: Approximation algs I
7: Approximation algs II (slides/h/n)
Thu 9/19 8: Approximation algs III (slides/h/n)
Tue 9/24 9: Randomized Algorithms I (slides/h/n)
Thu 9/26 10: Randomized Algorithms II (slides/h/n)
Tue 10/1 11: Rand Alg III - Min Cut (slides/h/n)
Thu 10/3 12: Network Flow I (slides/h/n)
Tue 10/8 Midterm - 7:00pm - 9:20pm, DCL 1310
Thu 10/10 13: Network Flow II (slides/ h/ n)
Tue 10/15 14: Network Flow III (slides/ h/ n)
Thu 10/17 15: Network Flow IV (slides/ h/ n)
Thu 10/17 (????) Drop deadline
Tue 10/22 16: Mincost flow (slides/ h/ n)
Thu 10/24 17: Mincost flow II (slides/ h/ n)
Tue 10/29 18: Linear programming (slides/ h/ n)
Thu 10/31 19: LP II (slides/ h/ n)
Tue 11/5 20: LP III (slides/ h/ n)
Thu 11/7 21: Fast Fourier Transform (slides/ h/ n)
Tue 11/12 22: Sorting Network (slides/ h/ n)
Thu 11/14 23: Union find (slides/ h/ n)
Tue 11/19 24: Max cut, (slides/ h/ n)
Thu 11/21 25: A bit on Machine Learning, (slides/ h/ n)
Tue 11/26 Thanksgiving Vacation
Thu 11/28 Thanksgiving Vacation
Tue 12/3 26: Entropy (slides/ h/ n)
Thu 12/5 27: Entropy II (slides/ h/ n)
Tue 12/10 28: Entropy III, Shannon's theorem (slides/ h/ n)
Wed 12/18 Final: 7-10pm, Location: 1SIEBL-0216

Last modified: Mon Nov 11 18:17:45 CST 2013