Exponential-time approximation of weighted set cover.
Marek CyganLukasz KowalikMateusz WykurzPublished in: Inf. Process. Lett. (2009)
Keyphrases
- set cover
- approximation algorithms
- greedy algorithm
- greedy heuristics
- np hard
- network flow
- special case
- worst case
- solution space
- weight function
- greedy heuristic
- minimum cost
- primal dual
- convex hull
- efficient computation
- feature extraction
- reinforcement learning
- optimal solution
- search algorithm
- constraint satisfaction
- dynamic programming