Bounded VC-Dimension Implies a Fractional Helly Theorem
暂无分享,去创建一个
[1] Jiri Matousek,et al. Lectures on discrete geometry , 2002, Graduate texts in mathematics.
[2] David Haussler,et al. Epsilon-nets and simplex range queries , 1986, SCG '86.
[3] Marie-Françoise Roy,et al. Real algebraic geometry , 1992 .
[4] S. Basu,et al. On the number of cells defined by a family of polynomials on a variety , 1996 .
[5] M. Katchalski,et al. A problem of geometry in ⁿ , 1979 .
[6] Noga Alon,et al. Bounding the piercing number , 1995, Discret. Comput. Geom..
[7] M. Katchalski,et al. A Problem of Geometry in R n , 1979 .
[8] Jiří Matoušek,et al. A fractional Helly theorem for convex lattice sets , 2003 .
[9] N. Alon,et al. Piercing convex sets and the hadwiger-debrunner (p , 1992 .
[10] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..
[11] Noga Alon,et al. Transversal numbers for hypergraphs arising in geometry , 2002, Adv. Appl. Math..
[12] Bernard Chazelle,et al. Quasi-optimal range searching in spaces of finite VC-dimension , 1989, Discret. Comput. Geom..