Lecture Slides, CSE 421, Autumn 2015

LectureDateTopicReadingLecturerSlides
Lecture 1September 30Course Introduction, Stable MarriageKleinberg-Tardos, Section 1.1Richard Anderson (PPTX) (PDF) (PDF Handouts)
Lecture 2October 2Stable MarriageKleinberg-Tardos, Section 1.1Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 3October 5Five ProblemsKleinberg-Tardos, Section 1.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 4October 7RuntimeKleinberg-Tardos, Sections 2.1, 2.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 5October 9Graph TheoryKleinberg-Tardos, Sections 3.1, 3.2, 3.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 6October 12Graph TheoryKleinberg-Tardos, Sections 3.4, 3.5, 3.6Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 7October 14Greedy AlgorithmsKleinberg-Tardos, Sections 4.1, 4.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 8October 16Greedy AlgorithmsKleinberg-Tardos, Sections 4.2, 4.3Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 9October 19Shortest PathsKleinberg-Tardos, Section 4.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 10October 21Minimum Spanning Trees IKleinberg-Tardos, Section 4.5, 4.7Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 11October 23Minimum Spanning Trees IIKleinberg-Tardos, Section 4.5, 4.7Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 12October 26RecurrencesKleinberg-Tardos, Section 5.1, 5.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 13October 28RecurrencesKleinberg-Tardos, Section 5.1, 5.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 14October 30Divide and ConquerKleinberg-Tardos, Section 5.3, 5.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Midterm ExamNovember 21.1 - 5.2Kleinberg-Tardos, Section 1.1 - 5.2  
Lecture 15November 4Divide and ConquerKleinberg-Tardos, Section 5.4, 5.5Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 16November 6Fast Fourier TransformKleinberg-Tardos, Section 5.6Anup Rao No slides
Lecture 17November 9Dynamic ProgrammingKleinberg-Tardos, Sections 6.1, 6.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 18November 13Dynamic ProgrammingKleinberg-Tardos, Sections 6.1, 6.2, 6.3Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 19November 16Dynamic ProgrammingKleinberg-Tardos, Sections 6.6, 6.7Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 20November 18Shortest PathsKleinberg-Tardos, Sections 6.8-6.10Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 21November 20Network FlowKleinberg-Tardos, Sections 7.1 - 7.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 22November 23Network FlowKleinberg-Tardos, Sections 7.1 - 7.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 23November 25Network Flow and ApplicationsKleinberg-Tardos, Sections 7.5, 7.6, 7.12Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 24November 30Network Flow ApplicationsKleinberg-Tardos, Sections 7.10, 7.11Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 25December 2Network Flow Applications and NP-CompletenessKleinberg-Tardos, Sections 8.1-8.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 26December 4NP-CompletenessKleinberg-Tardos, Sections 8.1-8.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 27December 7NP-CompletenessKleinberg-Tardos, Sections 8.4-8.8Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 28December 9NP-CompletenessKleinberg-Tardos, Sections 8.4-8.8Richard Anderson (PPTX) (PDF) (PDF Handouts) (HTML with ink)
Lecture 29December 11NP-Completeness and beyond Richard Anderson (PPTX) (PDF) (PDF Handouts)