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

Suppose we are given a finite set of points $P$ in $R^3$ and a collection of polytopes $mathcal{T}$ that are all translates of the same polytope $T$. We consider two problems in this paper. The first is the set cover problem where we want to select a minimal number of polytopes from the collection $mathcal{T}$ such that their union covers all input points $P$. The second problem that we consider is finding a hitting set for the set of polytopes $mathcal{T}$, that is, we want to select a minimal number of points from the input points $P$ such that every given polytope is hit by at least one point. We give the first constant-factor approximation algorithms for both problems. We achieve this by providing an epsilon-net for translates of a polytope in $R^3$ of size $\bigO(frac{1{epsilon)$.

[1]  Jeong Hyun Kang,et al.  Combinatorial Geometry , 2006 .

[2]  Kenneth L. Clarkson,et al.  Improved Approximation Algorithms for Geometric Set Cover , 2005, Discret. Comput. Geom..

[3]  J. Komlos,et al.  Almost tight bounds for $\epsilon$-nets , 1992 .

[4]  Herbert Edelsbrunner,et al.  On the Number of Line Separations of a Finite Set in the Plane , 1985, J. Comb. Theory, Ser. A.

[5]  Michael T. Goodrich,et al.  Almost optimal set covers in finite VC-dimension: (preliminary version) , 1994, SCG '94.

[6]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[7]  Gerhard J. Woeginger,et al.  Some new bounds for Epsilon-nets , 1990, SCG '90.

[8]  P. Assouad.  Densité et dimension , 1983 .

[9]  Dror Rawitz,et al.  Hitting sets when the VC-dimension is small , 2005, Inf. Process. Lett..

[10]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[11]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[12]  Kenneth L. Clarkson,et al.  Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.

[13]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[14]  Neal E. Young,et al.  Randomized rounding without solving the linear program , 1995, SODA '95.

[15]  Jirí Matousek,et al.  How to net a lot with little: small ε-nets for disks and halfspaces , 1990, SCG '90.

[16]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[17]  Jirí Matousek,et al.  Reporting Points in Halfspaces , 1992, Comput. Geom..

[18]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.