Abstract
In the incremental versions of Facility Location and k-Median, the demand points arrive one at a time and the algorithm must maintain a good solution by either adding each new demand to an existing cluster or placing it in a new singleton cluster. The algorithm can also merge some of the existing clusters at any point in time. We present the first incremental algorithm for Facility Location with uniform facility costs which achieves a constant performance ratio and the first incremental algorithm for k-Median which achieves a constant performance ratio using \(\mbox{O}(k)\) medians.
This work was partially supported by the FET programme of the EU under contract numbers IST-1999-14186 (ALCOM-FT) and IST-2001-33116 (FLAGS). Part of this work was done while the author was at the Max-Planck-Institut für Informatik, Saarbrücken, Germany.
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. TR CS-03-16, Brown University (2003)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental Clustering and Dynamic Information Retrieval. In: Proc. of STOC 1997, pp. 626–635 (1997)
Charikar, M., O’Callaghan, L., Panigrahy, R.: Better Streaming Algorithms for Clustering Problems. In: Proc. of STOC 2003, pp. 30–39 (2003)
Charikar, M., Panigrahy, R.: Clustering to Minimize the Sum of Cluster Diameters. In: Proc. of STOC 2001, pp. 1–10 (2001)
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 (2004), Available from http://users.auth.gr/~fotakis/data/incremen.pdf
Guha, S., Mishra, N., Motwani, R., O’Callaghan, L.: Clustering Data Streams. In: Proc. of FOCS 2000, pp. 359–366 (2000)
Henzinger, M.R., Raghavan, P., Rajagopalan, S.: Computing on Data Streams. TR 1998-011, DEC Systems Research Center (1998)
Meyerson, A.: Online Facility Location. In: Proc. of FOCS 2001, pp. 426–431 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fotakis, D. (2004). Incremental Algorithms for Facility Location and k-Median. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive