Improved approximation algorithms for geometric set cover

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 135-141

  Clarkson, Kenneth L ^a   Varadarajan, Kasturi ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Approximation Algorithms; Set Cover

Indexed keywords

APPROXIMATION ALGORITHMS; CONSTANT-FACTOR; SET COVER;

ALGORITHMS; COMPUTATIONAL GEOMETRY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

APPROXIMATION THEORY;

EID: 33244466054     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064115     Document Type: Conference Paper

References (32)

1. 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.
2. 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.
3. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom., 14:263-279, 1995.
4. B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatorica, 10, 1990.
5. V. Chvátal. A greedy heuristic for the set-covering problem. Math. Oper. Res., 4:233-235, 1979.
6. K, L. Clarkson. New applications of random sampling in computational geometry. Discrete Comput. Geom., 2:195-222, 1987.
7. 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.
8. K. L. Clarkson. Las Vegas algorithms for linear and integer programming when the dimension is small. J. ACM, 42(2):488-499, 1995.
9. K. L. Clarkson, K. Mehlhorn, and R. Seidel. Four results on randomized incremental constructions. Comp. Geom.: Theory and Applications, pages 185-121, 1993.
10. K. L. Clarkson and P. Shor. Applications of random sampling in computational geometry, II. Discrete and Computational Geometry, 4:387-421, 1989.
11. 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.
12. 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.
13. A. Efrat. The complexity of the union of (α, β)-covered objects. In Proc. 15th Annual Symposium on Computational Geometry, pages 134-142, 1999.
14. 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.
15. 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.
16. U. Feige. A threshold of In n for approximating set cover. Journal of the ACM, 45:634-652, 1998.
17. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete Comput. Geom., 2:127-151, 1987.
18. 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.
19. D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci., 9:256-278, 1974.
20. 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.
21. V. S. A. Kumar and H. Ramesh. Covering rectilinear polygons with axis-parallel rectangles. SIAM J. Comput., 32(6):1509-1541, 2003.
22. 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.
23. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Math., 13:383-390, 1975.
24. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM, 41:960-981, 1994.
25. J. Matoušek. Reporting points in halfspaces. Comput. Geom. Theory Appl., 2(3):169-186, 1992.
26. 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.
27. 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.
28. J. S. B. Mitchell and S. Suri. Separation and approximation of polyhedral objects. Comput. Geom. Theory Appl., 5:95-114, 1995.
29. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1993.
30. M. Sharir. The complexity of the union of planar regions. http://imu.org.il/Meeting97/Abstracts/sharir.ps, 1997.
31. M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.
32. E. Welzl. Partition trees for triangle counting and other range searching problems. In Proc. Fourth ACM Symp. on Comp. Geometry, pages 23-33, 1988.