Geometric set cover and hitting sets for polytopes in ℝ3

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 479-490

  Laue, Sören ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Computational geometry; Epsilon nets; Hitting sets; Set cover

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL GEOMETRY;

CONSTANT-FACTOR APPROXIMATION ALGORITHMS; EPSILON-NETS; FINITE SET; HITTING SETS; POLYTOPES; SET COVER; SET COVER PROBLEM;

TOPOLOGY;

EID: 45749145832     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. P. Assouad. Densité et dimension. Ann. Inst. Fourier, 33(3):233-282, 1983.
2. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Learnability and the vapnik-chervonenkis dimension. J. ACM, 36(4):929-965, 1989.
3. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite vc-dimension: (preliminary version). In SoCG '94, pages 293-302, New York, NY, USA, 1994. ACM Press.
4. K. Clarkson. Las vegas algorithms for linear and integer programming when the dimension is small. J. ACM, 42(2):488-499, 1995.
5. K. L. Clarkson and K. Varadarajan. Improved approximation algorithms for geometric set cover. In SoCG '05, pages 135-141, New York, NY, USA, 2005. ACM Press.
6. H. Edelsbrunner and E. Welzl. On the number of line separations of a finite set in the plane. J. Comb. Theory, Ser. A, 38(1):15-29, 1985.
7. G. Even, D. Rawitz, and S. Shahar. Hitting sets when the vc-dimension is small. Inf. Process. Lett., 95(2):358-362, 2005.
8. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In FOCS '98, page 300, Washington, DC, USA, 1998. IEEE Computer Society.
9. D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and vlsi. J. ACM, 32(1):130-136, 1985.
10. J. Komlós, J. Pach, and G. J. Woeginger. Almost tight bounds for epsilon-nets. Discrete and Computational Geometry, 7:163-173, 1992.
11. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. J. ACM, 41(5):960-981, 1994.
12. J. Matousek. Lectures on Discrete Geometry. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2002.
13. J. Matoušek. Reporting points in halfspaces. Comput. Geom. Theory Appl., 2(3):169-186, 1992.
14. J. Matoušek, R. Seidel, and E. Welzl. How to net a lot with little: Small epsilon-nets for disks and halfspaces. In SoCG '90, pages 16-22, 1990.
15. J. Pach and P. K. Agarwal. Combinatorial Geometry. Wiley, New York, 1995.
16. J. Pach and G. Woeginger. Some new bounds for epsilon-nets. In SoCG '90, pages 10-15, New York, USA, 1990. ACM Press.
17. V. N. Vapnik and A. Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probability. Theory Probab. Appl., 16:264-280, 1971.
18. N. E. Young. Randomized rounding without solving the linear program. In SODA '95, pages 170-178, Philadelphia, PA, USA, 1995. Society for Industrial and Applied Mathematics.