IE512: Syllabus
Sewoong Oh, University of Illinois Urbana-Champaign
Here is a rough syllabus (changes are possible, and suggestions/feedback are welcome).
| date | lecture | lecture note | puzzle |
| Eulerian cycles, minimum spanning trees, matroids | lecture 1 | |
| bipartite matching, stable marriage, intersection of matroids | lecture 2 | |
| paths, counting trees, and connectivity | lecture 3 | |
| spectral properites of a graph | lecture 4 | |
| midterm | | |
| network flow | lecture 5 | |
| linear program | lecture 6 | |
| Thanksgiving break (no class) | | |
| linear program | | |
| | online algorithms | lecture 7 | |
| cake cutting | lecture 8 | |
| submodular optimization | lecture 9 |
|
|