Lecture | Date | Topic | Reading | Lecturer | Slides |
Lecture 1 | Wednesday, January 3 | Course Introduction | Kleinberg-Tardos, Section 1.1 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Section 1 | Thursday, January 4 | Stable Matching/Induction | | |
(PPTX)
(PDF)
(PPTX with Solutions)
(PDF with Solutions) |
Lecture 2 | Friday, January 5 | Stable Matching | Kleinberg-Tardos, Section 1.1 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Lecture 3 | Monday, January 8 | Graphs | Kleinberg-Tardos, Section 2.1, 2.2, 3.1, 3.2 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Lecture 4 | Wednesday, January 10 | Graph Algorithms | Kleinberg-Tardos, Sections 3.4, 3.5, 3.6 |
Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Section 2 | Thursday, January 11 | Graph Search / Asymptotics | | |
(PPTX)
(PDF)
(PPTX with Solutions)
(PDF with Solutions) |
Lecture 5 | Friday, January 12 | Greedy Algorithms | Kleinberg-Tardos, Sections 4.1, 4.2 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Holiday, MLK Day | Monday, January 15 | | | |
|
Lecture 6 | Wednesday, January 17 | Greedy Algorithms | Kleinberg-Tardos, Sections 4.2, 4.3 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Section 3 | Thursday, January 18 | Greedy Algorithms | | |
(PPTX)
(PDF)
(PPTX with Solutions)
(PDF with Solutions) |
Lecture 7 | Friday, January 19 | Dijkstra's Algorithm | Kleinberg-Tardos, Sections 4.4, 4.5 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Lecture 8 | Monday, January 22 | Minimum Spanning Trees | Kleinberg-Tardos, Sections 4.5, 4.9 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Lecture 9 | Wednesday, January 24 | Divide and Conquer | Kleinberg-Tardos, Sections 5.1, 5.2 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Section 4 | Thursday, January 25 | Divide and Conquer | | |
(PPTX with Solutions)
(PDF with Solutions) |
Lecture 10 | Friday, January 26 | Divide and Conquer | Kleinberg-Tardos, Sections 5.3, 5.4 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Lecture 11 | Monday, January 29 | Median and Quicksort | Kleinberg-Tardos, Sections 5.5 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Lecture 12 | Wednesday, January 31 | Dynamic Programming | Kleinberg-Tardos, Sections 6.1, 6.2 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Section 5 | Thursday, February 1 | Dynamic Programming | | |
(PPTX with Solutions)
(PDF with Solutions) |
Lecture 13 | Friday, February 2 | Dynamic Programming | Kleinberg-Tardos, Sections 6.1, 6.2, 6.3 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Lecture 14 | Monday, February 5 | Dynamic Programming | Kleinberg-Tardos, Sections 6.4, 6.6 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Lecture 15 | Wednesday, February 7 | Dynamic Programming | Kleinberg-Tardos, Sections 6.7, 6.8 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Section 6 | Thursday, February 8 | Midterm Review | | | |
Midterm | Friday, February 9 | | | |
|
Lecture 16 | Monday, February 12 | Shortest Paths | Kleinberg-Tardos, Sections 6.8, 6.9, 6.10 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Lecture 17 | Wednesday, February 14 | Network Flow | Kleinberg-Tardos, Sections 7.1, 7.2 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Section 7 | Thursday, February 15 | Algorithm Toolbox | | |
(PPTX with Solutions)
(PDF with Solutions) |
Lecture 18 | Friday, February 16 | Network Flow | Kleinberg-Tardos, Sections 7.2, 7.3 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Holiday, Presidents' Day | Monday, February 19 | | | |
|
Lecture 19 | Wednesday, February 21 | Network Flow | Kleinberg-Tardos, Sections 7.3, 7.5, 7.6 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Section 8 | Thursday, February 22 | Network Flow | | |
(PPTX)
(PDF) |
Lecture 20 | Friday, February 23 | Network Flow Applications | Kleinberg-Tardos, Sections 7.6, 7.10-7.12 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Lecture 21 | Monday, February 26 | Network Flow Applications | Kleinberg-Tardos, Sections 7.11, 7-13 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Lecture 22 | Wednesday, February 28 | NP-Completeness | Kleinberg-Tardos, Sections 8.1, 8.2 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Section 9 | Thursday, February 29 | NP-Completeness | | |
(PPTX)
(PDF) |
Lecture 23 | Friday, March 1 | NP-Completeness | Kleinberg-Tardos, Sections 8.1-8.4 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Lecture 24 | Monday, March 4 | NP-Completeness | Kleinberg-Tardos, Sections 8.4-8.8 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Lecture 25 | Wednesday, March 6 | Approximation Algorithms | Kleinberg-Tardos, Chapter 11 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|
Section 10 | Thursday, March 7 | NP-Completeness | | |
(PPTX)
(PDF) |
Lecture 26 | Friday, March 8 | Beyond NP-Completeness | Kleinberg-Tardos, Chapter 9 | Richard Anderson |
(PPTX)
(PDF)
(PDF Handouts)
(Slides with Ink)
(PDF with Ink)
|