Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anagnostopoulos, A., Bent, R., Upfal, E., Van Hentenryck, P.: A Simple and Deterministic Competitive Algorithm for Online Facility Location. Information and Computation 194, 175–202 (2004)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Bădoiu, M., Czumaj, A., Indyk, P., Sohler, C.: Facility Location in Sublinear Time. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 866–877. Springer, Heidelberg (2005)
Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental Clustering and Dynamic Information Retrieval. In: STOC 1997, pp. 626–635 (1997)
Charikar, M., O’Callaghan, L., Panigrahy, R.: Better Streaming Algorithms for Clustering Problems. In: STOC 2003, pp. 30–39 (2003)
Fotakis, D.: On the Competitive Ratio for Online Facility Location. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 637–652. Springer, Heidelberg (2003)
Fotakis, D.: Incremental Algorithms for Facility Location and k-Median. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 321–347. Springer, Heidelberg (2004)
Frahling, G., Sohler, C.: Coresets in Dynamic Geometric Data Streams. In: STOC 2005, pp. 209–217 (2005)
Guha, S., Meyerson, A., Mishra, N., Motwani, R., O’Callaghan, L.: Clustering Data Streams: Theory and Practice. IEEE Transactions on Knowledge and Data Engineering 15(3), 515–528 (2003)
Guha, S., Mishra, N., Motwani, R., O’Callaghan, L.: Clustering Data Streams. In: FOCS 2000, pp. 359–366 (2000)
Indyk, P.: Algorithms for Dynamic Geometric Problems over Data Streams. In: STOC 2004, pp. 373–380 (2004)
Meyerson, A.: Online Facility Location. In: FOCS 2001, pp. 426–431 (2001)
Muthukrishnan, S.: Data Streams: Algorithms and Applications. In: SODA 2003, invited talk (2003), Available at: http://athos.rutgers.edy/~muthu/stream-1-1.ps
Thorup, M.: Quick k-Median, k-Center, and Facility Location for Sparse Graphs. SIAM J. on Computing 34(2), 405–432 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fotakis, D. (2006). Memoryless Facility Location in One Pass. In: Durand, B., Thomas, W. (eds) STACS 2006. STACS 2006. Lecture Notes in Computer Science, vol 3884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11672142_50
Download citation
DOI: https://doi.org/10.1007/11672142_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32301-3
Online ISBN: 978-3-540-32288-7
eBook Packages: Computer ScienceComputer Science (R0)