Discrete & Computational Geometry · 2011 · 46 citations · 17 references
ComputingBuilding ScienceComputational GeometryApproximation AlgorithmsGeometric ApproximationRandomized Geometric AlgorithmsRobust Geometric ComputationPerimeter GuardingRandomized Covering Algorithms
17
A threshold of ln <i>n</i> for approximating set cover
Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text
A Greedy Heuristic for the Set-Covering Problem
Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations
Learnability and the Vapnik-Chervonenkis dimension
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler et al. · Journal of the ACM · 1989 · 1.9K citations · Full text