Packing-Based Approximation Algorithm for the k-Set Cover Problem
Martin FürerHuiwen YuPublished in: CoRR (2011)
Keyphrases
- set cover
- np hard
- approximation ratio
- dynamic programming
- genetic algorithm
- objective function
- computational complexity
- k means
- cost function
- approximation algorithms
- particle swarm optimization
- optimization algorithm
- learning algorithm
- search space
- optimal solution
- mathematical model
- linear program
- convex hull
- convergence rate
- linear programming