Syllabus for CS670: Advanced 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.
- 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
- Algorithms based on spectral properties and PageRank
- Basics of Game Theory
- The Multiplicative Weights Update Algorithm and Its Analysis
Back to the CS670 course homepage.