Lecture Schedule, CSE 417, Autumn 2024

LectureDateTopicReadingLecturerSlides
Lecture 1Wednesday, September 25Course Introduction Kleinberg-Tardos, Section 1.1Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 2Friday, September 27Stable MatchingKleinberg-Tardos, Section 1.1Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 3Monday, September 30Five ProblemsKleinberg-Tardos, Section 1.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 4Wednesday, October 2RuntimeKleinberg-Tardos, Section 2.1, 2.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 5Friday, October 4Graph Theory IKleinberg-Tardos, Section 3.1, 3.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 6Monday, October 7Graph Theory IIKleinberg-Tardos, Section 3.2, 3.3, 3.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 7Wednesday, October 9Graph Theory IIIKleinberg-Tardos, Section 3.2, 3.3, 3.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 8Friday, October 11Greedy Algorithms IKleinberg-Tardos, Section 4.1, 4.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 9Monday, October 14Greedy Algorithms IIKleinberg-Tardos, Section 4.2, 4.3Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 10Wednesday, October 16Greedy Algorithms IIIKleinberg-Tardos, Section 4.2, 4.3Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 11Friday, October 18Shortest PathsKleinberg-Tardos, Section 4.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 12Monday, October 21MSTKleinberg-Tardos, Section 4.4, 4.5Richard Anderson
Lecture 13Wednesday, October 23MSTKleinberg-Tardos, Section 4.4, 4.7Richard Anderson
Lecture 14Friday, October 25MST etc.Kleinberg-Tardos, Section 4.4, 4.7, 4.9Richard Anderson
Lecture 15Monday, October 28Divide and ConquerKleinberg-Tardos, Section 5.1-5.2Richard Anderson
Lecture 16Wednesday, October 30Divide and ConquerKleinberg-Tardos, Section 5.1-5.3Richard Anderson
MidtermFriday, November 1
Lecture 17Monday, November 4Divide and ConquerKleinberg-Tardos, Section 5.3-5.5Richard Anderson
Lecture 18Wednesday, November 6Divide and ConquerKleinberg-Tardos, Section 5.3-5.5Richard Anderson
Lecture 19Friday, November 8Dynamic Programming IKleinberg-Tardos, Section 6.1-6.2Richard Anderson
Holiday, Veterans DayMonday, November 11
Lecture 20Wednesday, November 13Dynamic Programming IIKleinberg-Tardos, Section 6.1-6.2Richard Anderson
Lecture 21Friday, November 15Dynamic Programming - Subset SumKleinberg-Tardos, Section 6.4Richard Anderson
Lecture 22Monday, November 18Dynamic Programming - String AlignmentKleinberg-Tardos, Section 6.6Richard Anderson
Lecture 23Wednesday, November 20Dynamic Programming - Shortest PathsKleinberg-Tardos, Section 6.8-6.9Richard Anderson
Holiday, ThanksgivingFriday, November 22
Lecture 24Monday, November 25Network Flow IKleinberg-Tardos, Section 7.1-7.2 Richard Anderson
Lecture 25Wednesday, November 27Network Flow IIKleinberg-Tardos, Section 7.1-7.2 Richard Anderson
Lecture 26Friday, November 29Network Flow ApplicationsKleinberg-Tardos, Section 7.5, 7.6, 7.12Richard Anderson
Lecture 27Monday, December 2Net Flow Applications and NP-Completeness IKleinberg-Tardos, Section 8.1, 8.2, 8.3Richard Anderson
Lecture 28Wednesday, December 4NP-Completeness IIKleinberg-Tardos, Section 8.3, 8.4, 8.5Richard Anderson
Lecture 29Friday, December 6NP-Completeness IIIKleinberg-Tardos, Section 8.5, 8.6, 8.7, 8.8 Richard Anderson
Final ExamMonday, December 9, 8:30am-10:20am