On the set multi-cover problem in geometric settings

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2009, Pages 341-350

  Chekuri, Chandra ^a   Clarkson, Kenneth L ^b   Sariel, Har Peled ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Cuttings; LP rounding; Set cover

Indexed keywords

APPROXIMATION RATIOS; CARDINALITIES; COVER PROBLEM; GENERAL VERSION; GEOMETRIC SHAPE; HALF SPACES; LP-ROUNDING; SET COVER; SET COVER PROBLEM; SET SYSTEM; THREE DIMENSIONS; VC-DIMENSION;

SET THEORY;

COMPUTATIONAL GEOMETRY;

EID: 70849136362     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542362.1542421     Document Type: Conference Paper

References (24)

1. B. Aronov, E. Ezra, and M. Sharir. Small-size eps-nets for axis-parallel rectangles and boxes. In Proc. 41st Annu. ACM Sympos. Theory Comput., 2009.
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):485-519, 1998. (Pubitemid 128352841)
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. Combinatorial, 10(3):229-249, 1990.
5. C. Chekuri, K. Clarkson, and S. Har-Peled. On the multi-cover problem in geometric settings. Full version: http://www.uiuc.edu/sariel/papers/08/multi cover, 2008.
6. K. L. Clarkson. Applications of random sampling in computational geometry, II. In Proc. 4th Annu. ACM Sympos. Comput. Geom., pages 1-11, 1988.
7. K. L. Clarkson. Algorithms for polytope covering and approximation. In Proc. 3th Workshop Algorithms Data Struct., volume 709 of Lect. Notes in Comp. Sci., pages 246-252. Springer-Verlag, 1993.
8. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
9. K. L. Clarkson and K. R. Varadarajan. Improved approximation algorithms for geometric set cover. Discrete Comput. Geom., 37(1):43-58, 2007.
10. M. de Berg and O. Schwarzkopf. Cuttings and applications. Internat. J. Comput. Geom. Appl., 5:343-355, 1995.
11. G. Even, D. Rawitz, and S. Shahar. Hitting sets when the VC-dimension is small. Inform. Process. Lett., 95(2):358-362, 2005.
12. T. Feder and D. H. Greene. Optimal algorithms for approximate clustering. In Proc. 20th Annu. ACM Sympos. Theory Comput., pages 434-444, 1988.
13. U. Feige. A threshold of ln n for approximating set cover. J. Assoc. Comput. Mach., 45(4):634-652, 1998.
14. C. Fragoudakis, E. Markou, and S. Zachos. Maximizing the guarded boundary of an art gallery is apx-complete. Comput. Geom. Theory Appl., 38(3):170-180, 2007.
15. S. Har-Peled. Geometric approximation algorithms. Class notes. Online at http://uiuc.edu/~sariel/teach/notes/aprx/, 2008.
16. Y. Li, P. M. Long, and A. Srinivasan. Improved bounds on the sample complexity of learning. J. Comput. Syst. Sci., 62(3):516-527, 2001.
17. P. M. Long. Using the pseudo-dimension to analyze approximation algorithms for integer programming. In Proc. 7th Workshop Algorithms Data Struct., volume 2125 of Lecture Notes Comput. Sci., pages 26-37, 2001.
18. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. J. Assoc. Comput. Mach., 41(5):960-981, 1994.
19. J. Matoušek. Reporting points in halfspaces. Comput. Geom. Theory Appl., 2(3):169-186, 1992.
20. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, NY, 1995.
21. J. Pach and P. K. Agarwal. Combinatorial Geometry. John Wiley & Sons, New York, NY, 1995.
22. M. T. Thai, F. Wang, D. H. Du, and X. Jia. Coverage problems in wireless sensor networks: design and analysis. Inter. J. Sensor Networks, 3(3):191-200, 2008. Special issue on Coverage Problems in Sensor Networks.
23. K. Varadarajan. Epsilon nets and union complexity. In Proc. 25th Annu. ACM Sympos. Comput. Geom., 2009.
24. V. V. Vazirani. Approximation algorithms. Springer-Verlag New York, Inc., New York, NY, USA, 2001.