Online unit clustering in higher dimensions
暂无分享,去创建一个
[1] Anupam Gupta,et al. Approximating Sparse Covering Integer Programs Online , 2012, Math. Oper. Res..
[2] Noga Alon,et al. The online set cover problem , 2003, STOC '03.
[3] Yossi Azar,et al. Online Mixed Packing and Covering , 2012, SODA.
[4] C. Imreh,et al. Grid based online algorithms for clustering problems , 2014, 2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI).
[5] Nimrod Megiddo,et al. On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..
[6] Marek Chrobak,et al. SIGACT news online algorithms column 8 , 2005, SIGA.
[7] Yossi Azar,et al. Online Algorithms for Covering and Packing Problems with Convex Objectives , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[8] Csanád Imreh,et al. An online 2-dimensional clustering problem with variable sized clusters , 2013 .
[9] Leah Epstein,et al. On the online unit clustering problem , 2007, TALG.
[10] Yossi Azar,et al. Online Lower Bounds via Duality , 2016, SODA.
[11] Csaba D. Tóth,et al. Online Unit Covering in Euclidean Space , 2017, COCOA.
[12] Joseph Naor,et al. Online Primal-Dual Algorithms for Covering and Packing , 2009, Math. Oper. Res..
[13] Adrian Dumitrescu,et al. Computational Geometry Column 68 , 2018, SIGA.
[14] Kent Quanrud,et al. On Approximating (Sparse) Covering Integer Programs , 2018, SODA.
[15] Timothy M. Chan,et al. An Improved Algorithm for Online Unit Clustering , 2007, Algorithmica.
[16] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..
[17] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[18] Jun Kawahara,et al. An improved lower bound for one-dimensional online unit clustering , 2015, Theor. Comput. Sci..
[19] Tomás Feder,et al. Optimal algorithms for approximate clustering , 1988, STOC '88.
[20] Leah Epstein,et al. Online unit clustering: Variations on a theme , 2008, Theor. Comput. Sci..
[21] Robert J. Fowler,et al. Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..
[22] David P. Williamson,et al. The Design of Approximation Algorithms , 2011 .
[23] János Csirik,et al. Online Clustering with Variable Sized Clusters , 2010, Algorithmica.
[24] Timothy M. Chan,et al. A Randomized Algorithm for Online Unit Clustering , 2006, Theory of Computing Systems.
[25] Wolfgang Maass,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.
[26] Rajeev Motwani,et al. Incremental clustering and dynamic information retrieval , 1997, STOC '97.
[27] Marek Chrobak,et al. SIGACT news online algorithms column 1 , 2003, SIGA.
[28] Marek Chrobak,et al. SIGACT news online algorithms column 13: 2007 - an offine perspective , 2008, SIGA.
[29] Kim S. Larsen,et al. Better bounds on online unit clustering , 2010, Theor. Comput. Sci..
[30] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.