Settling the APX-Hardness Status for Geometric Set Cover.
Nabil H. MustafaRajiv RamanSaurabh RayPublished in: FOCS (2014)
Keyphrases
- set cover
- approximation algorithms
- np hard
- worst case
- greedy algorithm
- greedy heuristics
- network flow
- special case
- greedy heuristic
- solution space
- linear programming
- optimal solution
- primal dual
- minimum cost
- np complete
- scheduling problem
- lower bound
- computational complexity
- linear program
- geometric structure
- upper bound
- training set
- face recognition
- image processing
- simulated annealing
- phase transition
- geometric constraints