| Description |
This is an advanced course in the design and analysis of combinatorial
algorithms, focusing on recent material and special topics, including:
randomized algorithms, approximation algorithms for NP-complete problems,
string algorithms, amortized analysis of data structures, and heuristic
methods such as simulated annealing. Material will be selected to
have little or no overlap with traditional introductory algorithms
courses. |