Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems.
Marek CyganMagnús M. HalldórssonGuy KortsarzPublished in: CoRR (2020)
Keyphrases
- related problems
- tight bounds
- set cover
- approximation algorithms
- upper bound
- greedy algorithm
- np hard
- worst case
- greedy heuristics
- special case
- lower bound
- broadly applicable
- network flow
- minimum cost
- range searching
- convex hull
- primal dual
- greedy heuristic
- solution space
- data sets
- multi dimensional
- cost function
- search algorithm
- social networks