| Date | Notes | Topics | Additional References |
|---|---|---|---|
| 01/08/09 | pdf tex | Eulerian Circuits | [LPV] Chapters 1 to 5 and Chapter 8 [IBA] Chapter 8 |
| 01/13/09 | pdf tex | Trees and Cayley's Theorem | Graph Theory Slides |
| 01/15/09 | pdf tex | Minimum Spanning Trees | A paper on phylogenetic trees [IBA] Chapter 10 [KT] Chapter 4 and MST Slides |
| 01/20/09 | pdf tex | Bipartite Graphs and Matching | [KT] Chapter 4 |
| 01/22/09 | pdf tex | Network FLow and Minimum Cut | [KT] Chapter 7 |
| 01/27/09 | pdf tex | Applications of Network Flow algorithms I | [KT] Chapter 7 Max-Flow Slides |
| 01/29/09 | pdf tex | Applications of Network Flow algorithms II | |
| 02/03/09 | pdf tex | Linear Programming | LP Slides |
| 02/05/09 | pdf tex | NP Completeness | [KT] Chapter 8 NP Slides, NP Compendium |
| 02/10/09 | pdf tex | Randomized Algorithms I: Polynomial identity, Perfect matchings |
|
| 02/12/09 | pdf tex | Randomized Algorithms II: Perfect matchings, Global min-cut |
"Matching is as Easy as Matrix Inversion" K. Mulmuley, U.V. Vazirani, V.V. Vazirani |
| 02/17/09 | pdf tex | Midterm Exam | Solutions: pdf tex |
| 02/19/09 | pdf tex | Probabilistic Method | |
| 02/24/09 | pdf tex | Approximation Algorithms I Job Scheduling, K-center, MAX-CUT |
[KT] Chapter 11 Approximation Algorithms Slides |
| 02/26/09 | pdf tex | Approximation Algorithms II TSP, LP relaxations |
|
| 03/03/09 | pdf tex | Approximation Algorithms III MAX-CUT via SDP, MAX-SAT |
"MAX-CUT via SDP" Paper by M. Goemans and D. Williamson |
| 03/03/09 | pdf tex | Stable Marriage |
"Deferred Acceptance Algorithms" Survey Paper by Al Roth |