Online Unit Covering in Euclidean Space
暂无分享,去创建一个
[1] Anirban Ghosh,et al. Unit Disk Cover for Massive Point Sets , 2019, SEA².
[2] David P. Williamson,et al. The Design of Approximation Algorithms , 2011 .
[3] Karol Borsuk. Drei Sätze über die n-dimensionale euklidische Sphäre , 1933 .
[4] Paul Liu,et al. A fast 25/6-approximation for the minimum unit disk cover problem , 2014, ArXiv.
[5] Csaba D. Tóth,et al. Online unit clustering in higher dimensions , 2017, WAOA.
[6] Nimrod Megiddo,et al. On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..
[7] Timothy M. Chan,et al. A Randomized Algorithm for Online Unit Clustering , 2006, Theory of Computing Systems.
[8] Noga Alon,et al. The online set cover problem , 2003, STOC '03.
[9] Gautam K. Das,et al. Unit disk cover problem in 2D , 2013, J. Discrete Algorithms.
[10] Karoly Bezdek,et al. The geometry of homothetic covering and illumination , 2016, 1602.06040.
[11] Teofilo F. Gonzalez,et al. Covering a Set of Points in Multidimensional Space , 1991, Inf. Process. Lett..
[12] A. Wyner. Capabilities of bounded discrepancy decoding , 1965 .
[13] Joseph Naor,et al. Online Primal-Dual Algorithms for Covering and Packing , 2009, Math. Oper. Res..
[14] Oleg R. Musin,et al. A survey on the kissing numbers , 2015 .
[15] Jehoshua Bruck,et al. A Geometric Theorem for Approximate Disk Covering Algorithms , 2001 .
[16] Adrian Dumitrescu,et al. Computational Geometry Column 68 , 2018, SIGA.
[17] Paz Carmi,et al. Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks , 2013, Int. J. Comput. Geom. Appl..
[18] K. Bezdek,et al. Hadwiger-Levi’s Covering Problem Revisited , 1993 .
[19] Bernard Chazelle,et al. On a circle placement problem , 1986, Computing.
[20] Michiel H. M. Smid,et al. Approximation algorithms for the unit disk cover problem in 2D and 3D , 2017, Comput. Geom..
[21] János Pach,et al. Research problems in discrete geometry , 2005 .
[22] Wolfgang Maass,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.
[23] Rajeev Motwani,et al. Incremental clustering and dynamic information retrieval , 1997, STOC '97.
[24] Kim S. Larsen,et al. Better bounds on online unit clustering , 2010, Theor. Comput. Sci..
[25] Matthew Jenssen,et al. On kissing numbers and spherical codes in high dimensions , 2018, Advances in Mathematics.
[26] Haim Kaplan,et al. Optimal Cover of Points by Disks in a Simple Polygon , 2011, SIAM J. Comput..
[27] Timothy M. Chan,et al. An Improved Algorithm for Online Unit Clustering , 2007, Algorithmica.
[28] Chi-Chang Chen,et al. A Novel Approximation Algorithm for Minimum Geometric Disk Cover Problem with Hexagon Tessellation , 2013 .
[29] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[30] Bin Fu,et al. An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem , 2007, AAIM.
[31] R. Rankin. The Closest Packing of Spherical Caps in n Dimensions , 1955, Proceedings of the Glasgow Mathematical Association.
[32] Robert J. Fowler,et al. Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..
[33] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..
[34] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[35] H. Martini,et al. Combinatorial problems on the illumination of convex bodies , 1999 .
[36] N. J. A. Sloane,et al. On Kissing Numbers in Dimensions 32 to 128 , 1998, Electron. J. Comb..
[37] Alejandro López-Ortiz,et al. On the discrete Unit Disk Cover Problem , 2012, Int. J. Comput. Geom. Appl..
[38] Horst Martini,et al. Illuminating and covering convex bodies , 2014, Discret. Math..
[39] Paul Liu,et al. Approximation Schemes for Covering and Packing in the Streaming Model , 2017, CCCG.
[40] Leah Epstein,et al. On the online unit clustering problem , 2007, TALG.
[41] Nabil H. Mustafa,et al. Improved Results on Geometric Hitting Set Problems , 2010, Discret. Comput. Geom..
[42] J. Matousek,et al. Using The Borsuk-Ulam Theorem , 2007 .
[43] Jun Kawahara,et al. An improved lower bound for one-dimensional online unit clustering , 2015, Theor. Comput. Sci..
[44] Tomás Feder,et al. Optimal algorithms for approximate clustering , 1988, STOC '88.
[45] Shiyan Hu,et al. Polynomial time approximation schemes for minimum disk cover problems , 2010, J. Comb. Optim..
[46] Timothy M. Chan,et al. An Improved Algorithm for Online Unit Clustering , 2008, Algorithmica.
[47] Alejandro López-Ortiz,et al. The Within-Strip Discrete Unit Disk Cover Problem , 2017, CCCG.