| Week | Topic | Reading | Homework |
|---|---|---|---|
| Sept. 30 | Graphs and Minimum Spanning Trees | S 1.4, 6 | HW 1 due Oct. 7 (.tex, .pdf) |
| Oct. 5, 7 | Convexity, Polyhedra, and Linear
Programming | S 2.1, 2.2, 2.4 | HW 2 due Oct. 14 |
| Oct. 12, 14 | Duality in LPs, Matchings | S 2.3, 2.4, 3.1 | HW 3 due Oct. 21 |
| Oct. 19, 21 | Matchings | S 3.2-3.4, 3.6 | HW 4 due Oct. 28 |
| Oct. 26, 28 | Network Flows | S 4.2-4.4 | HW 5 due Nov. 4 |
| Nov. 2, 4 | Max Flow and applications | S 4.5, 4.6 | HW 6 due Nov. 11 |
| Nov. 9 | Integer Programming and Total Unimodularity | S 8.1, 8.2, 8.3, 8.4 | HW 7 due Nov. 18 |
| Nov. 16,18 | TU matrices from graphs cont' |
S 8.3, 8.4 | HW 8 due Nov. 25 |
| Nov. 23, 25 | Approximations of Max Cut and SDPs | Laurent, Vallentin (Ch 2 & 7) | |
| Nov. 30, Dec. 2 | Matroids | S 10.1, 10.2, 10.3, 10.7 | HW 9 due Dec. 9 |
| Dec. 7, 9 | Matroid Intersection | S 10.4, 10.5 |