Memoryless Facility Location in One Pass

We present the first one-pass memoryless algorithm for metric Facility Location which maintains a set of facilities approximating the optimal facility configuration within a constant factor. The algorithm considers the demand points one-by-one in arbitrary order, is randomized and very simple to state and implement. It runs in linear time and keeps in memory only the facility locations currently open. We prove that its competitive ratio is less than 14 in the special case of uniform facility costs and less than 49 in the general case of non-uniform facility costs.

[1]  Sudipto Guha,et al.  Clustering data streams , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[2]  Russell Bent,et al.  A simple and deterministic competitive algorithm for online facility location , 2004, Inf. Comput..

[3]  Christian Sohler,et al.  Coresets in dynamic geometric data streams , 2005, STOC '05.

[4]  Dimitris Fotakis.  Incremental algorithms for Facility Location and k-Median , 2006, Theor. Comput. Sci..

[5]  Piotr Indyk,et al.  Facility Location in Sublinear Time , 2005, ICALP.

[6]  Mikkel Thorup,et al.  Quick k-Median, k-Center, and Facility Location for Sparse Graphs , 2001, SIAM J. Comput..

[7]  Sudipto Guha,et al.  Clustering Data Streams: Theory and Practice , 2003, IEEE Trans. Knowl. Data Eng..

[8]  Rina Panigrahy,et al.  Better streaming algorithms for clustering problems , 2003, STOC '03.

[9]  Piotr Indyk,et al.  Algorithms for dynamic geometric problems over data streams , 2004, STOC '04.

[10]  Rajeev Motwani,et al.  Incremental clustering and dynamic information retrieval , 1997, STOC '97.

[11]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[12]  Adam Meyerson,et al.  Online facility location , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[13]  Dimitris Fotakis,et al.  On the Competitive Ratio for Online Facility Location , 2003, Algorithmica.

[14]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.