Kenneth L. Clarkson
ABSTRACT
Given a collection S of subsets of some set U, and M ⊂ U, the set cover problem is to find the smallest subcollection C ⊂ S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve, even approximately, here we consider some geometric special cases, where usually U = Rd. Combining previously known techniques [3, 4], we show that polynomial time approximation algorithms with provable performance exist, under a certain general condition: that for a random subset R ⊂ S and function f(), there is a decomposition of the complement U ∖ ∪Y ∈ R Y into an expected f(|R|) regions, each region of a particular simple form. Under this condition, a cover of size O(f(|C|)) can be found in polynomial time. Using this result, and combinatorial geometry results implying bounding functions f(c) that are nearly linear, we obtain o(log c) approximation algorithms for covering by fat triangles, by pseudodisks, by a family of fat objects, and others. Similarly, constant-factor approximations follow for similar-sized fat triangles and fat objects, and for fat wedges. With more work, we obtain constant-factor approximation algorithms for covering by unit cubes in R3, and for guarding an x-monotone polygonal chain.
- B. Ben-Moshe, M. J. Katz, and J. S. B. Mitchell. A constant-factor approximation algorithm for optimal terrain guarding. In Proc. ACM-SIAM Symposium on Discrete Algorithms, to appear, 2005. Google Scholar
Digital Library
- J.-D. Boissonnat, M. Sharir, B. Tagansky, and M. Yvinec. Voronoi diagrams in higher dimensions under certain polyhedral distance functions. Discrete Comput. Geom., 19(4):473--484, 1998.Google ScholarCross Ref
- H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom., 14:263--279, 1995.Google ScholarDigital Library
- B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatorica, 10, 1990.Google Scholar
- V. Chvátal. A greedy heuristic for the set-covering problem. Math. Oper. Res., 4:233--235, 1979.Google ScholarDigital Library
- K. L. Clarkson. New applications of random sampling in computational geometry. Discrete Comput. Geom., 2:195--222, 1987.Google ScholarDigital Library
- K. L. Clarkson. Algorithms for polytope covering and approximation. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes Comput. Sci., pages 246--252. Springer-Verlag, 1993. Google ScholarDigital Library
- K. L. Clarkson. Las Vegas algorithms for linear and integer programming when the dimension is small. J. ACM, 42(2):488--499, 1995. Google ScholarDigital Library
- K. L. Clarkson, K. Mehlhorn, and R. Seidel. Four results on randomized incremental constructions. Comp. Geom.: Theory and Applications, pages 185--121, 1993. Google ScholarDigital Library
- K. L. Clarkson and P. Shor. Applications of random sampling in computational geometry, II. Discrete and Computational Geometry, 4:387--421, 1989.Google ScholarDigital Library
- G. Cǎlinescu, I. Mǎndoiu, P. Wan, and A. Zelikovsky. Selecting forwarding neighbors in wireless ad hoc networks. Mobile Networks and Applications, 9:101--111, 2004. Google ScholarDigital Library
- H. Edelsbrunner, L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir, and J. Snoeyink. On arrangements of jordan arcs with three intersections per pair. Discrete Comput. Geom, 4:523--539, 1989.Google ScholarDigital Library
- A. Efrat. The complexity of the union of (α, β)-covered objects. In Proc. 15th Annual Symposium on Computational Geometry, pages 134--142, 1999. Google ScholarDigital Library
- A. Efrat, G. Rote, and M. Sharir. On the union of fat wedges and separating a collection of segments by a line. Comput. Geom. Theory Appls, 3:277--288, 1994. Google ScholarDigital Library
- G. Even, D. Rawitz, and S. Shahar. Hitting sets when the VC-dimension is small. Manuscript, http://www.eng.tau.ac.il/ guy/Papers/VC.pdf+.Google Scholar
- U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45:634--652, 1998. Google ScholarDigital Library
- D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete Comput. Geom., 2:127--151, 1987.Google ScholarDigital Library
- D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM, 32:130--136, 1985. Google ScholarDigital Library
- D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci., 9:256--278, 1974.Google ScholarDigital Library
- K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of jordan regions and collision free translational motion amidst polygonal obstacles. Discrete Comput., 1:59--71, 1986. Google ScholarDigital Library
- V. S. A. Kumar and H. Ramesh. Covering rectilinear polygons with axis-parallel rectangles. SIAM J. Comput., 32(6):1509--1541, 2003. Google ScholarDigital Library
- N. Littlestone. Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. In Proc. 28th IEEE Symp. on Foundations of Computer Science, pages 68--77, 1987.Google ScholarDigital Library
- L. Lovász. On the ratio of optimal integral and fractional covers.Discrete Math., 13:383--390, 1975.Google ScholarDigital Library
- C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM, 41:960--981, 1994. Google ScholarDigital Library
- J. Matoušek. Reporting points in halfspaces. Comput. Geom. Theory Appl., 2(3):169--186, 1992. Google ScholarDigital Library
- J. Matoušek, J. Pach, M. Sharir, S. Sifrony, and E. Welzl. Fat triangles determine linearly many holes. SIAM J. Comput., 23:154--169, 1994. Google ScholarDigital Library
- J. Matoušek, R. Seidel, and E. Welzl. How to net a lot with little: small ε-nets for disks and halfspaces. In Proc. 6th Annu. ACM Sympos. Comput. Geom., pages 16--22, 1990. Google ScholarDigital Library
- J. S. B. Mitchell and S. Suri. Separation and approximation of polyhedral objects. Comput. Geom. Theory Appl., 5:95--114, 1995. Google ScholarDigital Library
- K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1993.Google Scholar
- M. Sharir. The complexity of the union of planar regions. http://imu.org.il/Meeting97/Abstracts/sharir.ps, 1997.Google Scholar
- M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995. Google ScholarDigital Library
- E. Welzl. Partition trees for triangle counting and other range searching problems. In Proc. Fourth ACM Symp. on Comp. Geometry, pages 23--33, 1988. Google ScholarDigital Library
Index Terms
- Improved approximation algorithms for geometric set cover
Recommendations
Improved Approximation Algorithms for Geometric Set Cover
Given a collection S of subsets of some set ${\Bbb U},$ and ${\Bbb M}\subset{\Bbb U},$ the set cover problem is to find the smallest subcollection $C\subset S$ that covers ${\Bbb M},$ that is, ${\Bbb M} \subseteq \bigcup (C),$ where $\bigcup(C)$ denotes ...
Partially Polynomial Kernels for Set Cover and Test Cover
An instance of the $(n-k)$-Set Cover or the $(n-k)$-Test Cover problems is of the form $(\mathcal{U},\mathcal{S},k)$, where $\mathcal{U}$ is a set with $n$ elements, $\mathcal{S}\subseteq 2^\mathcal{U}$ with $|\mathcal{S}|=m$, and $k$ is the parameter. The ...
Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
In the unweighted set cover problem we are given a set of elements $E=\{e_1,e_2,\ldots,e_n\}$ and a collection ${\cal F}$ of subsets of $E$. The problem is to compute a subcollection $SOL\subseteq{\cal F}$ such that $\bigcup_{S_j\in SOL}S_j=E$ and its ...
Comments