| Class Number | Date | Topics | Reading |
|---|---|---|---|
| 1 | 9/5 | Introduction, Administration, Algorithms and Complexity, Basic graph algorithms | Chapters 1,2,3 |
| 2 | 9/12 | Shortest Paths -- Bellman Ford, Dijkstra, data structures for Dijkstra | Chapter 4 |
| 3 | 9/19 RESCHEDULED FOR 9/21 at 10AM | Shortest Paths -- All pairs, relabeling, scaling, minimum-mean cycle | Chapter 5 |
| 4 | 9/26 | Maximum Flows -- Ford Fulkerson, max flow minimum cut, Edmonds-Karp | Chapter 6, 7.1-7.4 |
| 5 | 10/3 | Maximum Flows -- push/relabel algorithms, generic and FIFO | Chapter 7.6-7.9 |
| 6 | 10/10 | Maximum Flows | |
| 7 | 10/17 | Minimum Cost Flows | Chapter 9 |
| 8 | 10/24 | Minimum Cost Flows -- cycle cancelling | Chapter 10.5 |
| 9 | 10/31 | Minimum Cost Flows -- network simplex | Chapter 11 |
| 10 | 11/7 | Assignments and Matchings | Chapter 12 |
| 11 | 11/14 | Minimum Spanning Trees | Chapter 13 |
| 12 | 11/21 | Multicommodity flows | Chapter 17 |
| 13 | 11/28 (moved to 11/30, 10AM) | Multicommodity flows | |
| 14 | 12/5 | Additional topics |