Geometric Set Cover and Hitting Sets for Polytopes in $R^3$

Published in: CoRR (2008)

Keyphrases

set cover
greedy algorithm
convex hull
approximation algorithms
greedy heuristics
network flow
np hard
solution space
geometric constraints
data sets
multi dimensional
denoising
integer programming
primal dual
data structure
objective function
lattice points
machine learning