Decomposing Coverings and the Planar Sensor Cover Problem
暂无分享,去创建一个
[1] Sriram V. Pemmaraju,et al. Approximation Algorithms for Domatic Partitions of Unit Disk Graphs , 2009, APPROX-RANDOM.
[2] Mikkel Thorup,et al. OPT versus LOAD in dynamic storage allocation , 2003, STOC '03.
[3] Géza Tóth,et al. Convex Polygons are Cover-Decomposable , 2010, Discret. Comput. Geom..
[4] Gábor Tardos,et al. Multiple Coverings of the Plane with Triangles , 2007, Discret. Comput. Geom..
[5] Jean Cardinal,et al. Coloring Geometric Range Spaces , 2009, Discret. Comput. Geom..
[6] Jordan Gergov,et al. Algorithms for compile-time memory optimization , 1999, SODA '99.
[7] János Pach,et al. Decomposition of multiple coverings into many parts , 2007, SCG '07.
[8] Uriel Feige,et al. Approximating the domatic number , 2000, STOC '00.
[9] Suresh Venkatasubramanian,et al. Restricted strip covering and the sensor cover problem , 2007, SODA '07.
[10] J. Pach,et al. Decomposition problems for multiple coverings with unit balls, manuscript. , 1988 .
[11] Imran A. Pirwani,et al. Energy conservation via domatic partitions , 2006, MobiHoc '06.
[12] Dömötör Pálvölgyi,et al. Indecomposable Coverings with Concave Polygons , 2010, Discret. Comput. Geom..
[13] János Pach,et al. Covering the plane with convex polygons , 1986, Discret. Comput. Geom..
[14] Jean Cardinal,et al. Decomposition of Multiple Coverings into More Parts , 2008, SODA.