Lecture | Date | Topic | Reading | Lecturer | Slides |
Lecture 1 | January 5 | Course Introduction, Stable Marriage | Kleinberg-Tardos, Section 1.1 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 2 | January 7 | Stable Marriage | Kleinberg-Tardos, Section 1.1 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 3 | January 9 | Five Problems | Kleinberg-Tardos, Section 1.2 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 4 | January 12 | Runtime | Kleinberg-Tardos, Sections 2.1, 2.2 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 5 | January 14 | Graph Theory | Kleinberg-Tardos, Sections 3.1, 3.2, 3.4 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 6 | January 16 | Graph Theory | Kleinberg-Tardos, Sections 3.4, 3.5, 3.6 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 7 | January 21 | Greedy Algorithms | Kleinberg-Tardos, Sections 4.1, 4.2 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 8 | January 23 | Greedy Algorithms | Kleinberg-Tardos, Sections 4.2, 4.3 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 9 | January 26 | Shortest Paths | Kleinberg-Tardos, Section 4.4 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 10 | January 28 | Minimum Spanning Trees I | Kleinberg-Tardos, Section 4.5, 4.7 | Larry Ruzzo |
(PPT)
(PDF)
|
Lecture 11 | January 30 | Minimum Spanning Trees II | Kleinberg-Tardos, Section 4.5, 4.7 | Ben Birnbaum |
|
Lecture 12 | February 2 | Recurrences | Kleinberg-Tardos, Section 5.1, 5.2 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 13 | February 4 | Recurrences | Kleinberg-Tardos, Section 5.1, 5.2 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 14 | February 6 | Divide and Conquer | Kleinberg-Tardos, Section 5.3, 5.4 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Midterm Exam | February 9 | | Kleinberg-Tardos, Section 1.1 - 5.2 | |
|
Lecture 15 | February 11 | Divide and Conquer | Kleinberg-Tardos, Section 5.4, 5.5 | Punya Biswal |
(PPT)
(PDF)
|
Lecture 16 | February 13 | Fast Fourier Transform | Kleinberg-Tardos, Section 5.6 | Anna Karlin |
(PPT)
(PDF)
|
Lecture 17 | February 18 | Dynamic Programming | Kleinberg-Tardos, Sections 6.1, 6.2 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 18 | February 20 | Dynamic Programming | Kleinberg-Tardos, Sections 6.1, 6.2, 6.3 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 19 | February 23 | Dynamic Programming | Kleinberg-Tardos, Sections 6.6, 6.7 | James Lee |
(PPT)
(PDF)
|
Lecture 20 | February 25 | Shortest Paths | Kleinberg-Tardos, Sections 6.8-6.10 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 21 | February 27 | Network Flow | Kleinberg-Tardos, Sections 7.1 - 7.2 | Richard Anderson |
(PPT)
(PDF)
(PDF Activities)
(HTML)
|
Lecture 22 | March 2 | Network Flow | Kleinberg-Tardos, Sections 7.1 - 7.2 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 23 | March 4 | Network Flow Applications | Kleinberg-Tardos, Sections 7.5, 7.6, 7.12 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 24 | March 6 | Network Flow Applications | Kleinberg-Tardos, Sections 7.10, 7.11 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 25 | March 9 | NP-Completeness | Kleinberg-Tardos, Sections 8.1-8.4 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 26 | March 11 | NP-Completeness | Kleinberg-Tardos, Sections 8.1-8.4 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|
Lecture 27 | March 13 | NP-Completeness | Kleinberg-Tardos, Sections 8.4-8.8 | Richard Anderson |
(PPT)
(PDF)
(HTML)
|