| # | Date | lecture topic | reading | pset release | |
|---|---|---|---|---|---|
| 1 | 01-18 | T | Intro, Divide and Conquer (pdf; mp4) | Kleinberg-Tardos 5.1,5.2,5.5 | |
| 2 | 01-20 | R | Divide and Conquer (pdf; mp4) | Kleinberg-Tardos 5.1,5.4 | |
| 01-21 | F | pset0 (tex, pdf) (soln) | |||
| 3 | 01-25 | T | Dynamic Programming (pdf; mp4) | Kleinberg-Tardos 6.0-6.2 | |
| 4 | 01-27 | R | Dynamic Programming (pdf; mp4) | Kleinberg-Tardos 6.2,6.4 | |
| 01-28 | F | pset1 (tex, pdf) (soln) | |||
| 5 | 02-01 | T | Dynamic Programming (pdf; mp4) | Kleinberg-Tardos 6.6,6.7 | |
| 6 | 02-03 | R | Dynamic Programming (pdf; mp4) | Kleinberg-Tardos 6.8,6.10 | |
| 02-04 | F | pset2 (tex, pdf) (soln) | |||
| 7 | 02-08 | T | Flows (pdf; mp4) | Kleinberg-Tardos 7.0,7.1 | |
| 8 | 02-10 | R | Flows (pdf; mp4) | Kleinberg-Tardos 7.2 | |
| 02-11 | F | pset3 (tex, pdf) (soln) | |||
| 9 | 02-15 | T | Flows (pdf; mp4) | Kleinberg-Tardos 7.3 | |
| 10 | 02-18 | F | Flows (pdf; mp4) | Kleinberg-Tardos 7.5 | pset4 (tex, pdf) (soln) |
| 11 | 02-22 | T | Flows (pdf; mp4) | Kleinberg-Tardos 7.7,7.8 | |
| 02-24 | R | Exam 1 Review (mediaspace) | |||
| 02-25 | F | ||||
| 02-28 | M | exam1, 7-9:30pm, Siebel 1404 | |||
| 12 | 03-01 | T | Randomized Algorithms (pdf; mp4) | Kleinberg-Tardos 13.0,13.1,13.12 | |
| 13 | 03-03 | R | Randomized Algorithms (pdf; mp4) | Kleinberg-Tardos 13.3,13.5 | |
| 03-04 | F | pset5 (tex, pdf) | |||
| 14 | 03-08 | T | Randomized Algorithms (pdf; mp4/mediaspace) | KleinbergTardos 13.6 | |
| 15 | 03-10 | R | Randomized Algorithms (pdf; mp4/mediaspace) | KleinbergTardos 13.7 | |
| 03-11 | F | pset6 (tex, pdf) (soln) | |||
| 03-15 | T | spring break | |||
| 03-17 | R | spring break | |||
| 03-18 | F | ||||
| 16 | 03-22 | T | Randomized Algorithms (pdf; mp4/mediaspace) | KleinbergTardos 13.9,13.10 | |
| 17 | 03-24 | R | Randomized Algorithms (pdf; mp4/mediaspace) | KleinbergTardos 13.2 | |
| 03-25 | F | pset7 (tex, pdf) | |||
| 18 | 03-29 | T | Linear Programming (pdf; mp4/mediaspace) | Erickson §H.1-H.3; Har-Peled §21.5.3 | |
| 19 | 03-31 | R | Linear Programming (pdf; mp4/mediaspace) | Erickson §H.4-H.6; Har-Peled §21.5.3 | |
| 04-01 | F | pset8 (tex, pdf) | |||
| 20 | 04-05 | T | Linear Programming (pdf; mp4/mediaspace) | Chekuri (pdf), Matoušek-Gärtner §6.7 | |
| 04-07 | R | Exam 2 Review (mp4/mediaspace) | |||
| 04-08 | F | ||||
| 04-11 | M | exam2, 7-9:30pm, Siebel 1404 | (soln) | ||
| 21 | 04-12 | T | Linear Programming (mp4/mediaspace) | Matoušek-Gärtner §4.2,4.4 | |
| 22 | 04-14 | R | NP-Completeness (pdf; mp4/mediaspace) | Har-Peled (pdf, pdf) | |
| 04-15 | F | pset9 (tex, pdf) | |||
| 23 | 04-19 | T | NP-Completeness (pdf; mp4) | Har-Peled (pdf), KleinbergTardos 8.5 | |
| 24 | 04-21 | R | NP-Completeness (pdf; mp4) | KleinbergTardos 8.6,8.8 | |
| 04-22 | F | pset10 (tex, pdf) | |||
| 25 | 04-26 | T | Approximation Algorithms (pdf; mp4/mediaspace) | KleinbergTardos 11.1,11.3,11.8 | |
| 26 | 04-28 | R | Approximation Algorithms (pdf; mp4) | KleinbergTardos 11.6,11.7 | |
| 04-29 | F | pset11 (tex, pdf) | |||
| 27 | 05-03 | T | Approximation Algorithms (pdf; mp4) | Williamson and Shmoys 1.7,5.1,5.3,5.4,5.5 | |
| 05-11 | W | final, 7-10pm, Siebel 1404 | (soln) |