Lecture Schedule, CSE 417, Autumn 2020

LectureDateTopicReadingLecturerSlides
Lecture 1Wednesday, September 30Course Introduction Kleinberg-Tardos, Section 1.1Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 2Friday, October 2Stable MatchingKleinberg-Tardos, Section 1.1Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 3Monday, October 5Five ProblemsKleinberg-Tardos, Section 1.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 4Wednesday, October 7RuntimeKleinberg-Tardos, Sections 2.1, 2.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 5Friday, October 9Graph TheoryKleinberg-Tardos, Sections 3.1, 3.2, 3.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 6Monday, October 12Graph TheoryKleinberg-Tardos, Sections 3.1, 3.2, 3.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 7Wednesday, October 14Graph TheoryKleinberg-Tardos, Sections 3.1, 3.2, 3.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 8Friday, October 16Greedy AlgorithmsKleinberg-Tardos, Sections 4.1, 4.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 9Monday, October 19Greedy AlgorithmsKleinberg-Tardos, Section 4.2, 4.3Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 10Wednesday, October 21Greedy AlgorithmsKleinberg-Tardos, Section 4.3, 4.5Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 11Friday, October 23Shortest PathsKleinberg-Tardos, Section 4.5, 4.7, 4.9Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 12Monday, October 26Shortest PathsKleinberg-Tardos, Section 4.5, 4.7, 4.9Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 13Wednesday, October 28Minimum Spanning TreesKleinberg-Tardos, Section 5.1, 5.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 14Friday, October 30MST and Recurrences Part 1Kleinberg-Tardos, Section 5.1, 5.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 15Monday, November 2Recurrences Part 2Kleinberg-Tardos, Section 5.1, 5.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 16Wednesday, November 4Divide and ConquerKleinberg-Tardos, Section 5.3-5.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 17Friday, November 6Divide and ConquerKleinberg-Tardos, Section 5.3-5.5Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 18Monday, November 9Divide and Conquer Kleinberg-Tardos, Section 5.3Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Veterans DayWednesday, November 11
Lecture 19Friday, November 13Dynamic ProgrammingKleinberg-Tardos, Section 6.1, 6.2, 6.3 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 20Monday, November 16Dynamic ProgrammingKleinberg-Tardos, Section 6.3, 6.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 21Wednesday, November 18Dynamic ProgrammingKleinberg-Tardos, Section 6.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 22Friday, November 20Longest Common SubsequenceKleinberg-Tardos, Section 6.6 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 23Monday, November 23Shortest Paths with Dynamic ProgrammingKleinberg-Tardos, Section 6.8 and 6.10 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 24Wednesday, November 25Network Flow IKleinberg-Tardos, Section 7.1-7.2 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Black FridayFriday, November 27
Lecture 25Monday, November 30Network Flow IIKleinberg-Tardos, Section 7.1-72Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 26Wednesday, December 2Network Flow Applications IKleinberg-Tardos, Section 7.5, 7.6, 7.12Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 27Friday, December 4Netflow Application and NP-CompletenessKleinberg-Tardos, Section 8.1-8.4 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 28Monday, December 7NP-Completeness IIKleinberg-Tardos, Sections 8.1-8.4 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 29Wednesday, December 9NP-Completeness IIIKleinberg-Tardos, Sections 8.4-8.8 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)
Lecture 30Friday, December 11NP-Completeness and BeyondRichard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (Zoom Video)