Lecture Slides, CSE 421, Winter 2009

LectureDateTopicReadingLecturerSlides
Lecture 1January 5Course Introduction, Stable MarriageKleinberg-Tardos, Section 1.1Richard Anderson (PPT) (PDF) (HTML)
Lecture 2January 7Stable MarriageKleinberg-Tardos, Section 1.1Richard Anderson (PPT) (PDF) (HTML)
Lecture 3January 9Five ProblemsKleinberg-Tardos, Section 1.2Richard Anderson (PPT) (PDF) (HTML)
Lecture 4January 12RuntimeKleinberg-Tardos, Sections 2.1, 2.2Richard Anderson (PPT) (PDF) (HTML)
Lecture 5January 14Graph TheoryKleinberg-Tardos, Sections 3.1, 3.2, 3.4Richard Anderson (PPT) (PDF) (HTML)
Lecture 6January 16Graph TheoryKleinberg-Tardos, Sections 3.4, 3.5, 3.6Richard Anderson (PPT) (PDF) (HTML)
Lecture 7January 21Greedy AlgorithmsKleinberg-Tardos, Sections 4.1, 4.2Richard Anderson (PPT) (PDF) (HTML)
Lecture 8January 23Greedy AlgorithmsKleinberg-Tardos, Sections 4.2, 4.3Richard Anderson (PPT) (PDF) (HTML)
Lecture 9January 26Shortest PathsKleinberg-Tardos, Section 4.4Richard Anderson (PPT) (PDF) (HTML)
Lecture 10January 28Minimum Spanning Trees IKleinberg-Tardos, Section 4.5, 4.7Larry Ruzzo (PPT) (PDF)
Lecture 11January 30Minimum Spanning Trees IIKleinberg-Tardos, Section 4.5, 4.7Ben Birnbaum  
Lecture 12February 2RecurrencesKleinberg-Tardos, Section 5.1, 5.2Richard Anderson (PPT) (PDF) (HTML)
Lecture 13February 4RecurrencesKleinberg-Tardos, Section 5.1, 5.2Richard Anderson (PPT) (PDF) (HTML)
Lecture 14February 6Divide and ConquerKleinberg-Tardos, Section 5.3, 5.4Richard Anderson (PPT) (PDF) (HTML)
Midterm ExamFebruary 9 Kleinberg-Tardos, Section 1.1 - 5.2  
Lecture 15February 11Divide and ConquerKleinberg-Tardos, Section 5.4, 5.5Punya Biswal (PPT) (PDF)
Lecture 16February 13Fast Fourier TransformKleinberg-Tardos, Section 5.6Anna Karlin (PPT) (PDF)
Lecture 17February 18Dynamic ProgrammingKleinberg-Tardos, Sections 6.1, 6.2Richard Anderson (PPT) (PDF) (HTML)
Lecture 18February 20Dynamic ProgrammingKleinberg-Tardos, Sections 6.1, 6.2, 6.3Richard Anderson (PPT) (PDF) (HTML)
Lecture 19February 23Dynamic ProgrammingKleinberg-Tardos, Sections 6.6, 6.7James Lee (PPT) (PDF)
Lecture 20February 25Shortest PathsKleinberg-Tardos, Sections 6.8-6.10Richard Anderson (PPT) (PDF) (HTML)
Lecture 21February 27Network FlowKleinberg-Tardos, Sections 7.1 - 7.2Richard Anderson (PPT) (PDF) (PDF Activities) (HTML)
Lecture 22March 2Network FlowKleinberg-Tardos, Sections 7.1 - 7.2Richard Anderson (PPT) (PDF) (HTML)
Lecture 23March 4Network Flow ApplicationsKleinberg-Tardos, Sections 7.5, 7.6, 7.12Richard Anderson (PPT) (PDF) (HTML)
Lecture 24March 6Network Flow ApplicationsKleinberg-Tardos, Sections 7.10, 7.11Richard Anderson (PPT) (PDF) (HTML)
Lecture 25March 9NP-CompletenessKleinberg-Tardos, Sections 8.1-8.4Richard Anderson (PPT) (PDF) (HTML)
Lecture 26March 11NP-CompletenessKleinberg-Tardos, Sections 8.1-8.4Richard Anderson (PPT) (PDF) (HTML)
Lecture 27March 13NP-CompletenessKleinberg-Tardos, Sections 8.4-8.8Richard Anderson (PPT) (PDF) (HTML)