| Week | Topics | Reading |
|---|---|---|
| 1 | Introduction, Administration, Review of Algorithms and Complexity, Basic graph algorithms, Linear Time Minimum Spanning Trees | Chapters 1,2,3, 13, and this paper |
| 2 | Shortest Paths -- data structures for Dijkstra, Relabelling, Scaling, Minimum Mean Cycle | 5 |
| 3 | Maximum Flows -- Ford Fulkerson, max flow minimum cut, Edmonds-Karp | Chapter 6, 7.1-7.4 |
| 4 | Maximum Flows -- push/relabel algorithms, generic and FIFO | Chapter 7.6-7.9 |
| 5 | Maximum Flows -- additional topics, newer algorithms | |
| 6 | Minimum Cost Flows -- general algorithms | Chapter 9 |
| 7 | Minimum Cost Flows -- cycle cancelling | Chapter 10.5 |
| 8 | Assignments and Matchings | Chapter 12 |
| 9 | Stable Marriage | Chapter 12 |
| 10 | Multicommodity flows | Chapter 17, also material about multiplicative weights algorithms |
| 11 | Minimum cuts, Gomry-Hu trees | Papers |
| 12 | Approximation algorithms | CLRS, chapter 36 |
| 13 | Approximation algorithms | Max-Cut via SDP, other approximation algorithms |