CSC 8560 - Discrete Approximation Algorithms and Metaheuristics

4 Credit Hours
Prerequisites: CSC 4520 or CSC 6520 with a grade of C or higher.
Description
Approximation algorithms and metaheuristics for combinatorial problems: Set Cover, Steiner Trees, Multiway Cut, k-Center, Feedback Vertex Set, Shortest Superstring, Knapsack, Bin Packing, Minimum Makespan Scheduling. Primal-Dual Approximation algorithms: Steiner Forest.