Approximations and optimal geometric divide-And-conquer

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 505-511

  Matousek, Jiřf ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; GEOMETRY; PARAMETER ESTIMATION;

ASYMPTOTICALLY OPTIMAL; DETERMINISTIC ALGORITHMS; DISJOINT INTERIORS; DIVIDE AND CONQUER; NATURAL PROOFS; RANGE SPACES; RUNNING TIME; VC DIMENSION;

OPTIMIZATION;

EID: 85031734140     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/103418.103470     Document Type: Conference Paper

References (13)

1. P. K. Agarwal: Partitioning arrangements of lines I: An efficient deterministic algorithm. Discrete & Computational Geometry, 5:449-483, 1990.
2. A. Blumer, A. Ehrenfeucht, D. Haussler:, and M. Warmuth: Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension. Jo urn al of the ACM, 36, 1989.
3. B. Chazelle and J. Friedman: A deterministic view of random sampling and its use in geometry. Combinatorica, 10, 1990.
4. B. Chazelle and E. Welzl: Quasi-optimal range searching in spaces of finite VC-dimension. Discrete & Computational Geometry, 4:467-490, 1989.
5. D. Haussler and E. Welzl: s-nets and simplex range queries. Discrete B Computational Geometry, 2:127-151, 1987.
6. J. Kornh, manuscript, 1990.
7. J. Matousek: Construction of c-nets. Discrete & Computational Geomety, 5:427-448, 1990.
8. J. Matousek: Cutting hyperplane arrangements. In Proc. 6. ACM Symposium on Computational Geometry, pages 1-9, 1990. To appear in Discrete /3 Computational Geometry 1991.
9. J. Path and G. Woginger: Some new bounds for epsilon-nets. In Proc. 6. ACM Symposium on Comptitational Geometry, pages 10-15, 1990.
10. P. Raghavan: Probabilistic construction of deterministic algorithms: Approximating packing integer programs. In Proc. 27. IEEE Symposium on Foundations of Computer Science, pages 10-18, 1986.
11. N. Sauer: On the density of families of sets. Journal of Combin. Theoy Ser. A, 13:145-147, 1972.
12. R. Spencer: Ten lectures on the probabilistic method. CBMS-NSF, SIAM, 1987.
13. V. N. Vapnik and A. Ya. Chervonenkis: On the uniform convergence of relat ive frequencies of events to their probabilities. Theory Probab. Appl., 16:264-280, 1971.