Supplementary Reading:
Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms.
T.C. Hu and M.T. Shing, Combinatorial Algorithms.
Cook, Cunningham, Pulleyblank, and Schrijver, Combinatorial Optimization.
Korte and Vygen, Combinatorial Optimization: Theory and Algorithms.
Kleinberg and Tardos, Algorithm Design.
Dieter Jungnickel, Graphs, Networks & Algorithms.
Alexander Schrijver, Combinatorial Optimization, Vol A, B, C.
Lecture 1: BFS, DFS, Dijkstra [April 4]
Slides: PS PDF
Lecture 2: Minimum Spanning Tree [April 6]
Slides: PS PDF
Lecture 3: Minimum Spanning Tree and Floyd-Warshall [April 11]
Slides: PS PDF
Lecture 4: Dynamic Programming and Knapsack [April 18]
Slides: PS PDF
Lecture 5: Weighted Interval Scheduling [April 25]
Slides: PS PDF
Lecture 6: Knapsack [April 25]
Slides: PS PDF
Lecture 7: Network Flow [May 4]
Slides: PS PDF
Lecture 8: Minimum Cost Alphabetic Binary Trees [May 11]
Slides: PS PDF
Lecture 9: Multiterminal Network Flow [May 25]
Slides: PS PDF
Lecture 10: Multiterminal Network Flow Synthesis [May 30]
Slides: PDF
Lecture 12: Review of Topics [June 1]
Slides: PDF
Correction: On slide 22, it should read min 0 <= x_2 <= floor(y/v_2)
Other Slides
April 4th PDF
April 20th PDF
May 15th PDF
May 16th PDF
May 23rd PDF