| Week | Topic | Reading | Homework |
|---|---|---|---|
| Sept. 24 | Graphs and Minimum Spanning Trees Notes: 09/24 | S 1.4, 6 | HW 1 due Oct. 3 (.tex, .pdf) |
| Sept. 29, Oct. 1 | Convexity, Polyhedra, and Linear
Programming Notes: 09/29, 10/01 Video: 09/29, 10/01 | S 2.1, 2.2, 2.4 | HW 2 due Oct. 10 (.tex, .pdf) |
| Oct. 6, 8 | Duality in LPs, Matchings Notes: 10/06, 10/08 Video: 10/06, 10/08 | S 2.3, 2.4, 3.1 | HW 3 due Oct. 17 (.tex, .pdf) |
| Oct. 13, 15 | Matchings Notes: 10/13, 10/15 Video: 10/13, 10/15 | S 3.2-3.4, 3.6 | HW 4 due Oct. 24 (.tex, .pdf) |
| Oct. 20, 22 | Network Flows Notes: 10/20, 10/22 Video: 10/20, 10/22 | S 4.2-4.4 | HW 5 due Oct. 31 (.tex, .pdf) |
| Oct. 27, 29 | Max Flow and applications Notes: 10/27, 10/29 Video: 10/27, 10/29 | S 4.5, 4.6 | HW 6 due Nov. 7 (.tex, .pdf) |
| Nov. 3, 5 | Integer Programming and Total Unimodularity Notes: 11/03, 11/05 Video: 11/03, 11/05 | S 8.1, 8.2, 8.3, 8.4 | HW 7 due Nov. 14 (.tex, .pdf) |
| Nov. 10, 12 | TU matrices from graphs cont' Notes: 11/10, 11/12 Video: 11/10, 11/12 | S 8.3, 8.4 | HW 8 due Nov. 21 |
| Nov. 17, 19 | Approximations of Max Cut and SDPs | Laurent, Vallentin (Ch 2 & 7) | |
| Nov. 24, 26 | Matroids | S 10.1, 10.2, 10.3, 10.7 | HW 9 due Dec. 5 |
| Dec. 1, 3 | Matroids (cont') | S 10.4, 10.5 |