Most of the slides were prepared during the quarter, this is the first time they are used, there are probably some typos and errors, please let me know if you find any (email to tami@cs.washington.edu ).
Some slides are based on previous lecture notes of this course (formerly known as CSE 589) as given in University of Washington by Anna Karlin and Richard Ladner. I also used some slides of Steven Rudich from Carnegie Mellon University (1st lecture), David Luebke from University of Virginia (dynamic programming and introduction to NP-completeness theory), and Julia Chuzhoy from the Technion, Israel (linear programming).
Slides should appear here by noon of each class day and will be available in PDF format (4 slides per page - for printing).
Lecture 1 (3/31/2003): Introduction, Stable Marriage
Lecture 2 (4/7/2003): Graph Algorithms: BFS, DFS, Algorithms for Shortest Path.
Lecture 3 (4/14/2003): Graph Algorithms: Minimum spanning tree, Graph coloring
Lecture 4 (4/21/2003): Network Flow
Lecture 5 (4/28/2003): NP-completeness theory
Lecture 6 (5/5/2003): Coping with NP-hardness, Approximation Algorithms.
Lecture 7 (5/12/2003): Dynamic Programming and Linear Programming.
Slides in PDF (DP) Slides in PDF (LP)
Lecture 8 (5/19/2003): Linear Programming (cont.), Greedy Algorithms.
Lecture 9 (5/22/2003): Scheduling Problems, Resource Allocation.
Lecture 10 (6/2/2003): On-line Algorithms.