Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems.
Magnús M. HalldórssonGuy KortsarzMarek CyganPublished in: WAOA (2020)
Keyphrases
- related problems
- tight bounds
- set cover
- approximation algorithms
- upper bound
- greedy algorithm
- worst case
- np hard
- greedy heuristics
- network flow
- special case
- stable marriage
- broadly applicable
- minimum cost
- lower bound
- range searching
- greedy heuristic
- solution space
- integer programming
- convex hull
- primal dual
- scheduling problem
- computational complexity
- data structure
- objective function
- training data