Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces.
Nabil H. MustafaRajiv RamanSaurabh RayPublished in: SIAM J. Comput. (2015)
Keyphrases
- polynomial time approximation
- set cover
- approximation algorithms
- np hard
- greedy heuristics
- special case
- minimum cost
- worst case
- greedy algorithm
- error bounds
- approximation guarantees
- constant factor
- lower bound
- greedy heuristic
- constraint satisfaction problems
- network flow
- scheduling problem
- optimal solution
- approximation ratio
- computational complexity
- primal dual
- integer programming
- convex hull
- training data