(1+ Є)-approximation for facility location in data streams
暂无分享,去创建一个
Artur Czumaj | Christian Sohler | Christiane Lammersen | Morteza Monemizadeh | A. Czumaj | C. Sohler | M. Monemizadeh | Christiane Lammersen
[1] Samir Khuller,et al. Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.
[2] Satish Rao,et al. A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem , 2007, SIAM J. Comput..
[3] Éva Tardos,et al. Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.
[4] Joachim Gehweiler,et al. A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem , 2006, SPAA '06.
[5] Christian Sohler,et al. Coresets in dynamic geometric data streams , 2005, STOC '05.
[6] Joachim Gehweiler,et al. Kinetic Facility Location , 2008, Algorithmica.
[7] David P. Woodruff,et al. 1-pass relative-error Lp-sampling with applications , 2010, SODA '10.
[8] David P. Woodruff,et al. Efficient Sketches for Earth-Mover Distance, with Applications , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[9] Shi Li. A 1.488 approximation algorithm for the uncapacitated facility location problem , 2013, Inf. Comput..
[10] George L. Nemhauser,et al. The uncapacitated facility location problem , 1990 .
[11] Satish Rao,et al. Approximation schemes for Euclidean k-medians and related problems , 1998, STOC '98.
[12] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.
[13] Dorit S. Hochbaum,et al. Heuristics for the fixed cost median problem , 1982, Math. Program..
[14] Piotr Indyk,et al. Algorithms for dynamic geometric problems over data streams , 2004, STOC '04.
[15] David P. Woodruff,et al. The Data Stream Space Complexity of Cascaded Norms , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[16] Said Salhi,et al. Discrete Location Theory , 1991 .
[17] Christian Sohler,et al. Facility Location in Dynamic Geometric Data Streams , 2008, ESA.
[18] Satish Rao,et al. A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem , 1999, ESA.
[19] Nimrod Megiddo,et al. On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..
[20] Piotr Indyk,et al. Sampling in dynamic data streams and applications , 2005, Int. J. Comput. Geom. Appl..
[21] Piotr Indyk,et al. Facility Location in Sublinear Time , 2005, ICALP.
[22] Sariel Har-Peled,et al. On coresets for k-means and k-median clustering , 2004, STOC '04.
[23] Ke Chen,et al. On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications , 2009, SIAM J. Comput..
[24] C. Greg Plaxton,et al. The online median problem , 1999, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[25] David P. Woodruff,et al. Optimal approximations of the frequency moments of data streams , 2005, STOC '05.