| SES # | LECTURE NOTES |
|---|---|
| 1, 2, 3 | Matching Algorithms (PDF) |
| 4 | Polyhedral Combinatorics (PDF) |
| 5 | The Matching Polytope: Bipartite Graphs (PDF) |
| 6 | The Matching Polytope: General Graphs (PDF) |
| 7, 8 | Flow Duality and Algorithms (PDF) |
| 9 | Minimum Cuts (PDF) |
| 10, 11 | Not yet available. |
| 12 | Linear Programs (PDF) |
| 13, 15 | The Simplex Algorithm (PDF) |
| 16 | The Primal-dual Algorithm (PDF) |
| 17, 18 | The Ellipsoid Algorithm (PDF) |
| 19, 20 | Separation Oracles (PDF) |
| 21 | NP-completeness (PDF) |
| 22, 23, 24 | Approximation Algorithms (PDF) |
There are no lecture notes for sessions during which an exam was given (Ses.# 14 and 25) or a review (Ses.# 26 and 27).
