approximation algorithms and traveling salesperson problem. It will involve formulating a solution/algorithm for some problem and then implementing it in Python to pass test cases. Final is open ...

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, ...

Note: This course description is only applicable for the ... graph algorithms, problems in P and NP, and approximation algorithms.