Epsilon nets and union complexity

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2009, Pages 11-16

  Varadarajan, Kasturi ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

Approximation algorithms; Epsilon nets; Set cover

Indexed keywords

COMBINATORIAL COMPLEXITY; COMBINATORIAL PROBLEM; EPSILON NETS; FRACTIONAL SOLUTIONS; GENERAL CLASS; GEOMETRIC OBJECTS; INTEGRAL SOLUTIONS; K POINTS; POLYNOMIAL-TIME ALGORITHMS; SET COVER; SET COVER PROBLEM; UPPER BOUND;

COMPUTATIONAL GEOMETRY; DISKS (MACHINE COMPONENTS); DISKS (STRUCTURAL COMPONENTS); POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 70849098820     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542362.1542366     Document Type: Conference Paper

References (24)

1. N. Alon and S. Smorodinsky. Conflict-Free Colorings of Shallow Disks, In Proc. Annual Symposium on Comput. Geometry, 2006.
2. N. Alon and J. H. Spencer. The Probabilistic Method. John Wiley and Sons, Inc. 1992.
3. B. Aronov, E. Ezra, and M. Sharir. Small-size ε-nets for axis-parallel rectangles and boxes, to appear in the Proc. ACM Symposium on the Theory of Computing, 2009.
4. B. Ben-Moshe, M. J. Katz, and J. S. B. Mitchell. A constant-factor approximation algorithm for optimal terrain guarding. Proc. ACM-SIAM Symposium onDiscrete Algorithms, 515-524, 2005.
5. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom., 14:263-279, 1995.
6. B. Chazelle and J. Matousek. On linear-time deterministic algorithms for optimization problems in fixed dimension, J. Algorithms 21 (1996), 579-597.
7. V. Chvátal. A greedy heuristic for the set-covering problem. Math. Oper. Res., 4:233-235, 1979.
8. K. L. Clarkson. New applications of random sampling in computational geometry. Discrete Comput. Geom., 2:195-222, 1987.
9. 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.
10. K. L. Clarkson and P. Shor. Applications of random sampling in computational geometry, II. Discrete and Computational Geometry, 4:387-421, 1989.
11. K. Clarkson and K. Varadarajan. Improved approximation algorithms for geometric set cover.Discrete and Computational Geometry, 37:43-58, 2007,
12. G. Even, D. Rawitz, and S. Shahar. Hitting sets when the VC-dimension is small. Information Processing Letters 95(2): 358-362, 2005.
13. U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45:634-652, 1998.
14. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete Comput. Geom., 2:127-151, 1987.
15. D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci., 9:256-278, 1974.
16. 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.
17. V. S. A. Kumar and H. Ramesh. Covering rectilinear polygons with axis-parallel rectangles. SIAM J. Comput., 32(6):1509-1541, 2003.
18. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Math., 13:383-390, 1975.
19. J. Matoušek. Reporting points in halfspaces. Comput. Geom. Theory Appl., 2(3):169-186, 1992.
20. 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.
21. 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.
22. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1993.
23. E. Pyrga and S. Ray. New existence proofs for ε-nets. In Proc. Symposium on Computational Geometry, 199-207, 2008.
24. M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.