Piercing Axis-Parallel Boxes
暂无分享,去创建一个
[1] Timothy M. Chan,et al. Approximation Algorithms for Maximum Independent Set of Pseudo-Disks , 2009, Discrete & Computational Geometry.
[2] János Pach,et al. Tight lower bounds for the size of epsilon-nets , 2010, SoCG '11.
[3] Saurabh Ray,et al. New existence proofs ε-nets , 2008, SCG '08.
[4] E. Helly. Über Mengen konvexer Körper mit gemeinschaftlichen Punkte. , 1923 .
[5] G. Wegner,et al. Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner , 1965 .
[6] Alexandr V. Kostochka,et al. Covering boxes by points , 1993, Discret. Math..
[7] Gy. K árolyi. On point covers of parallel rectangles , 1991 .
[8] Rudolf Ahlswede,et al. Intersection Graphs of Rectangles and Segments , 2006, GTIT-C.
[9] Micha Sharir,et al. Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes , 2010, SIAM J. Comput..
[10] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[11] BORIS ARONOV,et al. Small-size ε-nets for axis-parallel rectangles and boxes , 2009, STOC '09.
[12] Arseny Akopyan. On Point Coverings of Boxes in $\mathbb R^d$ , 2007 .
[13] András Gyárfás,et al. Covering and coloring problems for relatives of intervals , 1985, Discret. Math..