Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
- Week 1
- Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
- Week 2
- Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
- Week 3
- Huffman codes; introduction to dynamic programming.
- Week 4
- Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.