Approximation Algorithms

3 Credits

Fundamentals of algorithmic paradigms, analysis, techniques, and software. Topics include greedy methods, randomized algorithms, lP-rounding, approximability, covering, packing, clustering, and network problems.