Login / Signup
On the Approximability of a Geometric Set Cover Problem.
Valentin E. Brimkov
Andrew Leach
Jimmy Wu
Michael Mastroianni
Published in:
Electron. Colloquium Comput. Complex. (2011)
Keyphrases
</>
set cover
approximation algorithms
greedy algorithm
np hard
greedy heuristics
special case
network flow
worst case
convex hull
minimum cost
greedy heuristic
solution space
geometric constraints
image processing
machine learning
neural network
upper bound
particle swarm optimization