Packing-Based Approximation Algorithm for the k-Set Cover Problem.
Martin FürerHuiwen YuPublished in: ISAAC (2011)
Keyphrases
- set cover
- objective function
- np hard
- optimization algorithm
- learning algorithm
- k means
- dynamic programming
- packing problem
- computational complexity
- cost function
- optimization problems
- linear programming
- simulated annealing
- error tolerance
- approximation ratio
- network flow
- approximation algorithms
- image restoration
- search space
- optimal solution
- feature extraction