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, ...
The unbounded knapsack problem: given a knapsack of some capacity and a set of items that have a weight and a value, determine the maximum value of items you can place in your knapsack. The number of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback