September 30: Stable Matching (Chapter 1)
Basics of Algorithm Analysis (Chapter 2; will not be covered)
Graphs (Chapter 3; will not be covered)
October 5: Greedy Algorithms (Sections 4.1-4.4)
October 7: Minimum Spanning Tree (Sections 4.6-4.7)
October 7: Matroid Greedy Algorithm
October 12: Divide and Conquer Algorithms (Sections 5.1-5.4)
October 12: Divide and Conquer: Multiplication (Sections 5.5-5.6)
October 14: Dynamic Programming (Sections 6.1-6.7)
October 19: Bellman-Ford Shortest Paths (Sections 6.8-6.10)
October 21: Maximum Flow (Sections 7.1-7.3)
October 26,28: Maximum Flow Applications (Sections 7.5-7.12)
November 2: Intractability (Sections 8.1-8.2) and NP-completeness (Sections 8.3-8.4, 8.9)
November 4: More NP-completeness (Sections 8.5-8.8, 8.10)
November 18: Linear Programming
November 30: Coping with NP-completeness
December 6: Online Algorithms