Weighted Geometric Set Cover via Quasi-Uniform Sampling

There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known with approximation guarantees better than that for the combinatorial set cover problem. In this article, we employ the idea of quasi-uniform sampling to obtain improved approximation guarantees in the weighted setting for a large class of problems for which such guarantees were known in the unweighted case. As a consequence of this sampling method, we obtain new results on the fractional set cover packing problem. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems—Geometrical problems and computations General Terms Algorithms, Theory Keywords Set cover, epsilon nets, approximation

• Type: Conference
• Year: 2010
• Where: STOC
• Authors: Kasturi Varadarajan
• Keywords: Approximation Guarantees, Set Cover, Set Cover Problem, STOC 2010