New and Improved Bounds for the Minimum Set Cover Problem.
Rishi SaketMaxim SviridenkoPublished in: APPROX-RANDOM (2012)
Keyphrases
- set cover
- greedy algorithm
- approximation algorithms
- np hard
- constant factor
- greedy heuristics
- lower bound
- upper bound
- worst case
- solution space
- network flow
- machine learning
- training data
- data structure
- convex hull
- constraint satisfaction problems
- minimum cost
- high dimensional
- computational complexity
- learning algorithm