Announcements
      Course info
      Schedule
      Homeworks
      Contact info


       UW CS
       Theory Group

Date	Lecture	Handouts	Readings
Sept 5	Lec 1: Intro & examples, Stable marriage problem	HW0, Course info	§ 1.1 (optional), § 2
Sept 7	Lec 2: Stable marriage problem, Graph algorithms: BFS, DFS		§ 1.1, § 2, § 3
Sept 12	Lec 3: Directed graph connectivity, Shortest paths	HW1, Sol0	§ 3.5, § 3.6, § 4.4
Sept 14	Lec 4: Greedy algorithms (MST)		§ 4.4, § 4.5
Sept 19	Lec 5: Greedy Algorithms (Scheduling, Huffman Codes)		§ 4.1, § 4.2, § 4.8
Sept 21	Lec 6: Huffman Codes, Divide & Conquer (Mergesort), Sorting lower bound		§ 4.8, § 5.1, § 5.3
Sept 26	Lec 7: Counting inversions, Linear time selection	HW2, Sol1	lecture notes
Sept 28	Lec 8: Fast Fourier Transform		§ 5.5, § 5.6
Oct 3	Lec 9: FFT, Closest Pair of Points		§ 5.6, § 5.4
Oct 5	Lec 10: Dynamic Programming (Knapsack, Interval scheduling)		§ 6.1, § 6.2, § 6.4
Oct 10	Lec 11: String Alignment, String Matching	HW3a, Sol2	§ 6.6, § 6.7, lecture notes
Oct 12	Lec 12: Shortest Paths revisited (Bellman-Ford)		§ 6.8, lecture notes
Oct 17	Lec 13: All-pairs shortest paths, Network flow	Sol3a	lecture notes, § 7.1
Oct 19	Lec 14: Review of techniques
Oct 24	MIDTERM EXAM
Oct 26	Lec 15: Network flow (Ford-Fulkerson)	HW3b	§ 7.1, § 7.2
Oct 31	Lec 16: Max-flow min-cut theorem and applications		§ 7.2, § 7.5, § 7.6
Nov 2	Lec 17: Applications of max flow; improvements in augmenting paths	HW4a, Sol3b	§ 7.3, § 7.6, § 7.7
Nov 7	Lec 18: Min-cost max-flow, Randomized algorithms (communication)		lecture notes, § 13.1
Nov 9	Lec 19: Randomized algorithms, contention resolution, random variables & expectations	HW4b, Sol4a	§ 13.1, § 13.3
Nov 14	Lec 20: Randomized selection, Quicksort, randomized mincut		§ 13.5, § 13.2
Nov 16	Lec 21: Hashing	HW5a, Sol4b	§ 13.6, § 13.12, lecture notes
Nov 21	Lec 22: Hashing (contd.), Computational complexity, the classes P and NP		§ 8.3, § 8.1, § 8.4
Nov 23	THANKSGIVING HOLIDAY
Nov 28	Lec 23: NP-completness and reductions: Circuit-SAT, SAT, 3-SAT, Max-2-SAT	HW5b, Sol5a	§ 8.2, § 8.4, lecture notes
Nov 30	Lec 24: NP-completeness: Independent Set, Clique, Vertex Cover, Set Cover		§ 8.1, § 8.5, § 8.7
Dec 5	Lec 25: NP-completeness: Hamiltonian path, TSP, 3-D Matching, 3-Coloring	HW6a, Sol5b	§ 8.5, § 8.6, § 8.7
Dec 7	Lec 26: CoNP, PSPACE		§ 8.9, § 9.1, § 9.3
Dec 12	Lec 27: Approximation Algorithms, Linear Programming	Sol6a	§ 11.3, § 11.4, § 11.6
Dec 14	Lec 28: Online Algorithms	Sample final solutions
Dec 18	FINAL EXAM