Improved pproximation algorithms for geometric set cover

Discrete and Computational Geometry

Volumn 37, Issue 1, 2007, Pages 43-58

  Clarkson, Kenneth L ^a   Varadarajan, Kasturi ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33846781469     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-006-1273-8     Document Type: Article

References (35)

1. B. Ben-Moshe, M. J. Katz, and J. S. B. Mitchell. A constant-factor approximation algorithm for optimal terrain guarding. Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 515-524, 2005.
2. P. Berman and B. Dasgupta. Approximating rectilinear polygonal cover problems. Algorithmica, 17(4):331-356, 1997.
3. 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.
4. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom., 14:263-279, 1995.
5. B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatorica, 10:229-249, 1990.
6. V. Chvátal. A greedy heuristic for the set-covering problem. Math. Oper. Res., 4:233-235, 1979.
7. K. L. Clarkson. New applications of random sampling in computational geometry. Discrete Comput. Geom., 2:195-222, 1987.
8. K. L. Clarkson. Algorithms for polytope covering and approximation. In Proc. 3rd Workshop on Algorithms and Data Structures, pages 246-252. Volume 709 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1993.
9. K. L. Clarkson. Las Vegas algorithms for linear and integer programming when the dimension is small. J. ACM, 42(2):488-499, 1995.
10. K. L. Clarkson, K. Mehlhorn, and R. Seidel. Four results on randomized incremental constructions. Comput. Geom. Theory Applic., 3:185-121, 1993.
11. K. L. Clarkson and P. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
12. G. Cǎlinescu, I. Mǎndoiu, P. Wan, and A. Zelikovsky. Selecting forwarding neighbors in wireless ad hoc networks. Mobile Networks Applic., 9:101-111, 2004.
13. 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.
14. A. Efrat. The complexity of the union of (α, β)-covered objects. SIAM J. Comput., 34(4):775-787, 2005.
15. 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 Applic., 3:277-288, 1994.
16. G. Even, D. Rawitz, and S. Shahar. Hitting sets when the VC-dimension is small. Inform. Process. Lett. 95(2):358-362, 2005.
17. U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45:634-652, 1998.
18. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete Comput. Geom., 2:127-151, 1987.
19. D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM, 32:130-136, 1985.
20. D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. System Sci., 9:256-278, 1974.
21. 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. Geom., 1:59-71, 1986.
22. V. S. A. Kumar and H. Ramesh. Covering rectilinear polygons with axis-parallel rectangles. SIAM J. Comput., 32(6):1509-1541, 2003.
23. 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.
24. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Math., 13:383-390, 1975.
25. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. J. ACM, 41:960-981, 1994.
26. J. Matoušek. Reporting points in halfspaces. Comput. Geom. Theory Applic., 2(3):169-186, 1992.
27. 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.
28. 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 Symp. on Computational Geometry, pages 16-22, 1990.
29. M. Megiddo and K. J. Supowit. On the complexity of some common geometric location problems. SIAM J. Comput., 13:182-196, 1984.
30. N. Megiddo and A. Tamir. On the complexity of locating linear facilities in the plane. Oper. Res. Lett., 1:194-197, 1982.
31. J. S. B. Mitchell and S. Suri. Separation and approximation of polyhedral objects. Comput. Geom. Theory Applic., 5:95-114, 1995.
32. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, NJ, 1993.
33. M. Sharir. The complexity of the union of planar regions. http://imu.org.il/Meeting97/Abstracts/sharir.ps, 1997.
34. M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.
35. E. Welzl. Partition trees for triangle counting and other range searching problems. In Proc. Fourth ACM Symp. on Computational Geometry, pages 23-33, 1988.