Lecture Schedule, CSE 421, Autumn 2019

LectureDateTopicReadingLecturerSlides
Lecture 1Wednesday, September 25Course Introduction, Stable MarriageKleinberg-Tardos, Section 1.1Anna Karlin (PPTX) (PDF) (PDF Handouts) (PDF Karlin)
Lecture 2Friday, September 27Stable MatchingKleinberg-Tardos, Section 1.1Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 3Monday, September 30Five ProblemsKleinberg-Tardos, Section 1.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 4Wednesday, October 2RuntimeKleinberg-Tardos, Sections 2.1, 2.2Richard Anderson (PPTX) (PDF) (PDF Handouts)
Lecture 5Friday, October 4Graph TheoryKleinberg-Tardos, Sections 3.1, 3.2, 3.4Robbie Weber (Robbie Weber's PDF Slides) (PPTX) (PDF) (PDF Handouts)
Lecture 6Monday, October 7Graph TheoryKleinberg-Tardos, Sections 3.4, 3.5, 3.6Paul Beame (Paul Beame's PDF Slides) (PPTX) (PDF) (PDF Handouts)
Lecture 7Wednesday, October 9Greedy AlgorithmsKleinberg-Tardos, Sections 4.1, 4.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 8Friday, October 11Greedy AlgorithmsKleinberg-Tardos, Sections 4.2, 4.3Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 9Monday, October 14Shortest PathsKleinberg-Tardos, Section 4.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 10Wednesday, October 16Minimum Spanning Trees IKleinberg-Tardos, Section 4.5, 4.7Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 11Friday, October 18Minimum Spanning Trees IIKleinberg-Tardos, Section 4.5, 4.7, 4.9Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 12Monday, October 21RecurrencesKleinberg-Tardos, Section 5.1, 5.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 13Wednesday, October 23Recurrences Part 2Kleinberg-Tardos, Section 5.1, 5.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 14Friday, October 25Divide and ConquerKleinberg-Tardos, Section 5.3, 5.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 15Monday, October 28Divide and ConquerKleinberg-Tardos, Section 5.4, 5.5Xin Yang (PPTX) (PDF) (PDF Handouts)
MidtermWednesday, October 30
Lecture 16Friday, November 1Fast Fourier TransformKleinberg-Tardos, Section 5.6Paul Beame (PDF) (PDF Handouts)
Lecture 17Monday, November 4Dynamic ProgrammingKleinberg-Tardos, Section 6.1, 6.2 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 18Wednesday, November 6Dynamic ProgrammingKleinberg-Tardos, Section 6.1, 6.2, 6.3 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 19Friday, November 8Dynamic ProgrammingKleinberg-Tardos, Section 6.6, 6.7Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Veteran's DayMonday, November 11
Lecture 20Wednesday, November 13Dynamic ProgrammingKleinberg-Tardos, Section 6.6, 6.7 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 21Friday, November 15Shortest PathsKleinberg-Tardos, Section 6.8-6.10 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 22Monday, November 18Network FlowKleinberg-Tardos, Section 7.1-7.2 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 23Wednesday, November 20Network FlowKleinberg-Tardos, Section 7.1-7.2 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 24Friday, November 22Network Flow ApplicationsKleinberg-Tardos, Section 7.5, 7.6, 7.12Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 25Monday, November 25Network Flow ApplicationsKleinberg-Tardos, Section 7.10, 7.11 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 26Wednesday, November 27NP-CompletenessKleinberg-Tardos, Sections 8.1-8.4 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Black FridayFriday, November 29
Lecture 27Monday, December 2NP-CompletenessKleinberg-Tardos, Sections 8.1-8.4 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 28Wednesday, December 4 NP-CompletenessKleinberg-Tardos, Sections 8.4-8.8 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 29Friday, December 6Copying with NP-Completeness and BeyondKleinberg-Tardos, Chapters 9 and 11Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)