Hitting sets when the VC-dimension is small

Information Processing Letters

Volumn 95, Issue 2, 2005, Pages 358-362

  Even, Guy ^a   Rawitz, Dror ^a   Shahar, Shimon ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Computational geometry; Hitting set; VC dimension

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; FUNCTIONS; ITERATIVE METHODS; LINEAR PROGRAMMING; PROBABILITY; THEOREM PROVING;

APPROXIMATION ALGORITHMS; APPROXIMATION RATIO; HITTING SETS; VC-DIMENSION;

SET THEORY;

EID: 20444474622     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.03.010     Document Type: Article

References (12)

1. A. Blumer, A. Ehrenfeucht, D. Haussler, and M.K. Warmuth Learnability and the Vapnik-Chervonenkis dimension J. ACM 36 4 1989 929 965
2. H. Brönnimann, and M.T. Goodrich Almost optimal set covers in finite VC-dimension Discrete Comput. Geom. 14 1995 463 479
3. D. Haussler, and E. Welzl ε-nets and simplex range queries Discrete Comput. Geom. 2 1987 127 151
4. J. Komlós, J. Pach, and G. Woeginger Almost tight bounds for ε-nets Discrete Comput. Geom. 7 1992 163 173
5. M. Luby, N. Nisan, A parallel approximation algorithm for positive linear programming, in: ACM Symp. on Theory of Computing, 1993, pp. 448-457
6. S. Mahajan, E.A. Ramos, and K.V. Subrahmanyam Solving some discrepancy problems in NC Algorithmica 29 3 2001 371 395
7. J. Matoušek Lectures on Discrete Geometry 2002 Springer-Verlag New York
8. J. Pach, and P.K. Agarwal Combinatorial Geometry 1995 J. Wiley New York
9. S.A. Plotkin, D.B. Shmoys, and É. Tardos Fast approximation algorithms for fractional packing and covering problems Math. Oper. Res. 20 1995 257 301
10. V.N. Vapnik, and A.Y. Chervonenkis On the uniform convergence of relative frequencies of events to their probabilities Theory Probab. Appl. 16 1971 264 280
11. N.E. Young, Randomized rounding without solving the linear program, in: 6th Annual ACM-SIAM Symp. Discrete Algorithms, 1995, pp. 170-178
12. N.E. Young, Sequential and parallel algorithms for mixed packing and covering, in: Proc. 42nd Annual IEEE Symp. on Foundations of Computer Science, 2001, pp. 538-546