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.
Back to the CS670 course homepage.
- Greedy Algorithms: Shortest Paths and Minimum Spanning Trees
- Dynamic Programming
- Max-Flow/Min-Cut and its applications
- Stable Matching
- Linear Programming: Properties and Applications
- Approximation Algorithms
- Randomized Algorithms
- Online Algorithms
- Algorithms based on spectral properties and PageRank