News
Unlike heuristics, approximation algorithms have provable performance guarantees ... linear programming (LP), semidefinite programming (SDP), LP duality, randomized rounding, and primal-dual analysis.
This course covers advanced topics in approximation algorithms for NP-hard problems, including combinatorial algorithms and LP-based algorithms for set cover, k-cut, k-center, feedback vertex set, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results