Lecture Schedule, CSE 417, Winter 2020

LectureDateTopicReadingLecturerSlides
Lecture 1Monday, January 6Course Introduction Kleinberg-Tardos, Section 1.1Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 2Wednesday, January 8Stable MatchingKleinberg-Tardos, Section 1.1Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 3Friday, January 10Five ProblemsKleinberg-Tardos, Section 1.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 4Monday, January 13RuntimeKleinberg-Tardos, Sections 2.1, 2.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 5Wednesday, January 15Graph TheoryKleinberg-Tardos, Sections 3.1, 3.2, 3.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 6Friday, January 17Graph TheoryKleinberg-Tardos, Sections 3.1, 3.2, 3.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 7Wednesday, January 22Graph TheoryKleinberg-Tardos, Sections 3.1, 3.2, 3.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 8Friday, January 24Greedy AlgorithmsKleinberg-Tardos, Sections 4.1, 4.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 9Monday, January 27Greedy AlgorithmsKleinberg-Tardos, Section 4.2, 4.3Paul Beame (PPTX) (PDF) (PDF Handouts)
Lecture 10Wednesday, January 29Shortest PathsKleinberg-Tardos, Section 4.5, 4.7Philip Garrison (PPTX) (PDF) (Philip's Slides - PDF) (PDF Handouts) (Slides with Ink)
Lecture 11Friday, January 31Minimum Spanning TreesKleinberg-Tardos, Section 4.5, 4.7, 4.9Philip Garrison (PPTX) (PDF) (Philip's Slides - PDF) (PDF Handouts) (Slides with Ink)
Lecture 12Monday, February 3Minimum Spanning TreesKleinberg-Tardos, Section 4.5, 4.7, 4.9Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 13Wednesday, February 5Recurrences Part 1Kleinberg-Tardos, Section 5.1, 5.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 14Friday, February 7Recurrences Part 2Kleinberg-Tardos, Section 5.1, 5.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
MidtermMonday, February 10Kleinberg-Tardos, Section 1.1-5.2
Lecture 15Wednesday, February 12Divide and ConquerKleinberg-Tardos, Section 5.3-5.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 16Friday, February 14Divide and ConquerKleinberg-Tardos, Section 5.3-5.5Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 17Wednesday, February 19Divide and Conquer and Dynamic ProgrammingKleinberg-Tardos, Section 5.3, 6.1, 6.2 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 18Friday, February 21Dynamic ProgrammingKleinberg-Tardos, Section 6.1, 6.2, 6.3 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 19Monday, February 24Dynamic ProgrammingKleinberg-Tardos, Section 6.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 20Wednesday, February 26Dynamic ProgrammingKleinberg-Tardos, Section 6.6Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 21Friday, February 28Shortest PathsKleinberg-Tardos, Section 6.6, 6.8, 6.10 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 22Monday, March 2Network FlowKleinberg-Tardos, Section 7.1-7.2 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 23Wednesday, March 4Network FlowKleinberg-Tardos, Section 7.1-7.2 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 24Friday, March 6Network Flow ApplicationsKleinberg-Tardos, Section 7.5, 7.6, 7.12Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 25Monday, March 9NP-Completeness IKleinberg-Tardos, Section 8.1-8.4 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 26Wednesday, March 11NP-Completeness IIKleinberg-Tardos, Sections 8.1-8.4 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 27Friday, March 13NP-Completeness IIIKleinberg-Tardos, Sections 8.4-8.8 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)