Lecture Schedule, CSE 421, Winter 2019

LectureDateTopicReadingLecturerSlides
Lecture 1Monday, January 7Course Introduction, Stable MarriageKleinberg-Tardos, Section 1.1Robbie Weber (PPTX) (PDF) (PDF Handouts)
Lecture 2Wednesday, January 9Stable MatchingKleinberg-Tardos, Section 1.1Richard Anderson (PPTX) (PDF) (PDF Handouts)
Lecture 3Friday, January 11Five ProblemsKleinberg-Tardos, Section 1.2Richard Anderson (PPTX) (PDF) (PDF Handouts)
Lecture 4Monday, January 14RuntimeKleinberg-Tardos, Sections 2.1, 2.2Richard Anderson (PPTX) (PDF) (PDF Handouts)
Lecture 5Wednesday, January 16Graph TheoryKleinberg-Tardos, Sections 3.1, 3.2, 3.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 6Friday, January 18Graph TheoryKleinberg-Tardos, Sections 3.4, 3.5, 3.6Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
MLK DayMonday, January 21
Lecture 7Wednesday, January 23Greedy AlgorithmsKleinberg-Tardos, Sections 4.1, 4.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 8Friday, January 25Greedy AlgorithmsKleinberg-Tardos, Sections 4.2, 4.3Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 9Monday, January 28Shortest PathsKleinberg-Tardos, Section 4.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 10Wednesday, January 30Minimum Spanning Trees IKleinberg-Tardos, Section 4.5, 4.7Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 11Friday, February 1Minimum Spanning Trees IIKleinberg-Tardos, Section 4.5, 4.7, 4.9Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Snow Day!Monday, February 4
Lecture 12Wednesday, February 6RecurrencesKleinberg-Tardos, Section 5.1, 5.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Snow Day! Again!Friday, February 8
Snow Day! And again!Monday, February 11
Midterm ExamWednesday, February 131.1 - 4.9Kleinberg-Tardos, Section 1.1 - 4.9  
Lecture 13Friday, 15Recurrences Part 2Kleinberg-Tardos, Section 5.1, 5.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Presidents' DayMonday, February 18
Lecture 14Wednesday, February 20Divide and ConquerKleinberg-Tardos, Section 5.3, 5.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 15Friday, February 22Divide and ConquerKleinberg-Tardos, Section 5.4, 5.5Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 16Monday, February 25Dynamic ProgrammingKleinberg-Tardos, Sections 6.1, 6.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 17Wednesday, February 27Dynamic ProgrammingKleinberg-Tardos, Sections 6.1, 6.2, 6.3Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 18Friday, March 1Dynamic ProgrammingKleinberg-Tardos, Sections 6.6, 6.7Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 19Monday, March 4Dynamic ProgrammingKleinberg-Tardos, Sections 6.6, 6.7Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 20Wednesday, March 6Shortest Paths and Network FlowKleinberg-Tardos, Sections 6.8-6.10, 7.1Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 21Friday, March 8Network FlowKleinberg-Tardos, Sections 7.1 - 7.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 22Monday, March 11Network FlowKleinberg-Tardos, Sections 7.1 - 7.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 23Wednesday, March 13Network Flow and ApplicationsKleinberg-Tardos, Sections 7.5, 7.6, 7.10-7.12Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)
Lecture 24Friday, March 15NP-CompletenessKleinberg-Tardos, Sections 8.1-8.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink)