| Homework | Due Date | Reading | HBS Problems |
|---|---|---|---|
| Homework 0: pdf, tex | 1/24 midnight | Prerequisites | discussion 1 |
| Homework 1: pdf, tex | 1/31 midnight | Chapters 3 from Dasgupta etal book, Lecture notes | discussion 2 |
| Homework 2: pdf, tex | 2/7 midnight | Chapters 3 from textbook and Dasgupta etal book, Lecture notes | discussion 3 |
| Homework 3: pdf, tex | 2/14 midnight | Chapter 2 from Dasgupta etal, Chap 5 from Kleinberg-Tardos, Lecture notes | discussion 4 |
| Homework 4: pdf, tex | 2/21 midnight | Chapter 6 from Dasgupta etal and Kleinberg-Tardos, Lecture notes | discussion 5 |
| Homework 5: pdf, tex | 3/6 midnight |
Chapters 6 from textbook, Lecture notes inputs.txt with test instances for Problem 1. |
discussion 6 |
| Homework 6: pdf, tex | 3/13 midnight | Chapters 5 from textbook, Lecture notes | discussion 7 |
| Homework 7: pdf, tex | 3/27 midnight | Lecture notes, Jeff's notes on randomized algorithms, Chapter 13 of Kleinberg-Tardos, | discussion 8 |
| Homework 8: pdf, tex | 4/03 midnight | Network Flow, Lecture Notes, Chapter 7 of Kleinberg-Tardos | discussion 9 |
| Homework 9: pdf, tex | 4/17 midnight | Network Flow Applications and Reductions | discussion 10 |
| Homework 10: pdf, tex | 4/24 midnight | Reductions and NP Completeness |
discussion 11 discussion 12 discussion 13 |