Syllabus for CS570: Analysis of Algorithms

This syllabus is meant as an outline. Depending on progress, material may be added or removed. Also, there will often be interesting tangents to follow.

• Introduction, Overview, Example: Stable Marriage
• Greedy Algorithms: Shortest Paths and Minimum Spanning Trees
• Dynamic Programming
• Max-Flow/Min-Cut and its applications
• NP-hardness
• Linear Programming: Properties and Applications
• Approximation Algorithms
• Randomized Algorithms
• Online Algorithms