Weighted geometric set cover via quasi-uniform sampling.
Kasturi R. VaradarajanPublished in: STOC (2010)
Keyphrases
- set cover
- uniform sampling
- computational geometry
- convex hull
- greedy algorithm
- approximation algorithms
- network flow
- np hard
- voronoi diagram
- solution space
- greedy heuristic
- sample size
- computer graphics
- computational complexity
- point sets
- geometric structure
- search algorithm
- active learning
- geometric information
- machine learning
- special case
- linear programming