Slides

This page contains slides that will be used in lecture. Note that we may not cover this material in precisely the same order.

Have fun exploring!

 

• Introduction
• Stable Matching
• Analysis
• Graphs
• Greedy Algorithms
• Minimum Spanning Trees
• Divide-and-Conquer Algorithms
• The Fast Fourier Transform
• Dynamic Programming
• The Bellman-Ford Algorithm
• Maximum Flow (Also see Resources page for animated versions)
• Applications of Max-Flow
• Assignment
• Intractability
• Polynomial-time reductions
• NP-Complete problems
• PSPACE
• Extending the limits of tractability
• Approximation Algorithms
• Local Search
• Randomized Algorithms