Schedule of Assigned Readings
Unless otherwise indicated, readings are from the required text Algorithm Design
by Kleinberg and Tardos.
- Before class on Fri Sep 7: Chapter 1 to the end of page 6
- By Sun Sep 9: All of Chapter 1
- By Sun Sep 16: All of Chapter 2
- By Sun Sep 23: Chapter 3, Sections 3.1-3.5
- By Sun Sep 30: Chapter 3, Section 3.6; Chapter 4, section 4.1
- By Sun Oct 7: Chapter 4, One of section 4.2, 4.3; section 4.4
- By Sun Oct 14: Chapter 4, section 4.5, 4.7
- By Sun Oct 21: Chapter 5, section 5.1, 5.2
- By Sun Oct 28: Chapter 5, section 5.3, 5.4
- By Sun Nov 4: Chapter 6, section 6.1, 6.2
- By Sun Nov 11: Chapter 6, section 6.3, 6.4
- By Sun Nov 18: Chapter 6, section 6.6; Chapter 8, section 8.1
- By Sun Nov 25: Chapter 8, section 8.3, 8.4 (only theorems (8.12), (8.14) and the section titled "General Strategy for Proving New Problems NP-Complete"), 8.10 (skim only) and one of 8.5, 8.7, 8.8