Lecture Schedule, CSE 421, Winter 2024

LectureDateTopicReadingLecturerSlides
Lecture 1Wednesday, January 3Course Introduction Kleinberg-Tardos, Section 1.1 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Section 1Thursday, January 4Stable Matching/Induction (PPTX) (PDF) (PPTX with Solutions) (PDF with Solutions)
Lecture 2Friday, January 5Stable Matching Kleinberg-Tardos, Section 1.1 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 3Monday, January 8Graphs Kleinberg-Tardos, Section 2.1, 2.2, 3.1, 3.2 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 4Wednesday, January 10Graph Algorithms Kleinberg-Tardos, Sections 3.4, 3.5, 3.6 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Section 2Thursday, January 11Graph Search / Asymptotics (PPTX) (PDF) (PPTX with Solutions) (PDF with Solutions)
Lecture 5Friday, January 12Greedy Algorithms Kleinberg-Tardos, Sections 4.1, 4.2 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Holiday, MLK DayMonday, January 15
Lecture 6 Wednesday, January 17Greedy AlgorithmsKleinberg-Tardos, Sections 4.2, 4.3 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Section 3Thursday, January 18Greedy Algorithms (PPTX) (PDF) (PPTX with Solutions) (PDF with Solutions)
Lecture 7 Friday, January 19Dijkstra's AlgorithmKleinberg-Tardos, Sections 4.4, 4.5 Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 8Monday, January 22Minimum Spanning TreesKleinberg-Tardos, Sections 4.5, 4.9Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 9 Wednesday, January 24Divide and ConquerKleinberg-Tardos, Sections 5.1, 5.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Section 4Thursday, January 25Divide and Conquer (PPTX with Solutions) (PDF with Solutions)
Lecture 10 Friday, January 26Divide and ConquerKleinberg-Tardos, Sections 5.3, 5.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 11Monday, January 29Median and QuicksortKleinberg-Tardos, Sections 5.5Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 12 Wednesday, January 31Dynamic ProgrammingKleinberg-Tardos, Sections 6.1, 6.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Section 5Thursday, February 1Dynamic Programming (PPTX with Solutions) (PDF with Solutions)
Lecture 13 Friday, February 2Dynamic ProgrammingKleinberg-Tardos, Sections 6.1, 6.2, 6.3Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 14 Monday, February 5Dynamic ProgrammingKleinberg-Tardos, Sections 6.4, 6.6Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 15 Wednesday, February 7Dynamic ProgrammingKleinberg-Tardos, Sections 6.7, 6.8Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Section 6Thursday, February 8Midterm Review
Midterm Friday, February 9
Lecture 16Monday, February 12Shortest PathsKleinberg-Tardos, Sections 6.8, 6.9, 6.10Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 17Wednesday, February 14Network FlowKleinberg-Tardos, Sections 7.1, 7.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Section 7Thursday, February 15Algorithm Toolbox (PPTX with Solutions) (PDF with Solutions)
Lecture 18Friday, February 16Network FlowKleinberg-Tardos, Sections 7.2, 7.3Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Holiday, Presidents' DayMonday, February 19
Lecture 19 Wednesday, February 21Network FlowKleinberg-Tardos, Sections 7.3, 7.5, 7.6Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Section 8Thursday, February 22Network Flow (PPTX) (PDF)
Lecture 20 Friday, February 23Network Flow ApplicationsKleinberg-Tardos, Sections 7.6, 7.10-7.12Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 21 Monday, February 26Network Flow ApplicationsKleinberg-Tardos, Sections 7.11, 7-13Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 22 Wednesday, February 28NP-CompletenessKleinberg-Tardos, Sections 8.1, 8.2Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Section 9Thursday, February 29NP-Completeness (PPTX) (PDF)
Lecture 23 Friday, March 1NP-CompletenessKleinberg-Tardos, Sections 8.1-8.4Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 24Monday, March 4NP-CompletenessKleinberg-Tardos, Sections 8.4-8.8Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Lecture 25 Wednesday, March 6Approximation AlgorithmsKleinberg-Tardos, Chapter 11Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)
Section 10Thursday, March 7NP-Completeness (PPTX) (PDF)
Lecture 26Friday, March 8Beyond NP-CompletenessKleinberg-Tardos, Chapter 9Richard Anderson (PPTX) (PDF) (PDF Handouts) (Slides with Ink) (PDF with Ink)