Computing Coverage Kernels Under Restricted Settings
暂无分享,去创建一个
[1] Micha Sharir,et al. Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes , 2010, SIAM J. Comput..
[2] Laks V. S. Lakshmanan,et al. The Generalized MDL Approach for Summarization , 2002, VLDB.
[3] Eric Torng,et al. A difference resolution approach to compressing Access Control Lists , 2013, 2013 Proceedings IEEE INFOCOM.
[4] Jirí Matousek,et al. Reporting Points in Halfspaces , 1992, Comput. Geom..
[5] Takao Asano,et al. Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane , 1983, J. Algorithms.
[6] Pankaj K. Agarwal,et al. Near-Linear Algorithms for Geometric Hitting Sets and Set Covers , 2014, Discrete & Computational Geometry.
[7] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[8] Joseph C. Culberson,et al. Covering Polygons Is Hard , 1994, J. Algorithms.
[9] Robert J. Fowler,et al. Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..
[10] Donald E. Knuth,et al. The Problem of Compatible Representatives , 1992, SIAM J. Discret. Math..
[11] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..
[12] Kenneth L. Clarkson,et al. Improved Approximation Algorithms for Geometric Set Cover , 2007, Discret. Comput. Geom..
[13] V. S. Anil Kumar,et al. Covering rectilinear polygons with axis-parallel rectangles , 1999, STOC '99.
[14] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[15] Alberto O. Mendelzon,et al. Concise descriptions of subsets of structured sets , 2005, TODS.
[16] Vadim V. Lozin,et al. NP-hard graph problems and boundary classes of graphs , 2007, Theor. Comput. Sci..
[17] Jérémy Barbay,et al. Depth Distribution in High Dimensions , 2017, COCOON.
[18] Michael T. Goodrich,et al. Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..
[19] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..
[20] Subhash Suri,et al. A Discrete and Dynamic Version of Klee's Measure Problem , 2011, CCCG.
[21] David Haussler,et al. Epsilon-nets and simplex range queries , 1986, SCG '86.
[22] Jirí Matousek,et al. Cutting hyperplane arrangements , 1990, SCG '90.
[23] Mark H. Overmars,et al. New upper bounds in Klee's measure problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[24] Timothy M. Chan. Klee's Measure Problem Made Easy , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[25] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[26] Joseph C. Culberson,et al. Covering polygons is hard , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[27] BORIS ARONOV,et al. Small-size ε-nets for axis-parallel rectangles and boxes , 2009, STOC '09.