Abstract
We present a randomized algorithm that maintains a constant factor approximation for the cost of the facility location problem in the dynamic geometric data stream model. In this model, the input is a sequence of insert and delete operations of points from a discrete space { 1 ...Δ}d, where d is a constant. The algorithm needs \(\log^{\mathcal{O}(1)}\Delta\) time to process an insertion or deletion of a point, uses \(\log^{\mathcal{O}(1)}\Delta\) bits of storage, and has a failure probability of 1/Δ Θ(1).
Supported by DFG grant So 514/1-1.
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
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)
Chang, K.L.: Pass-Efficient Algorithms for Facility Location. Technical Report YALEU/DCS/TR-1337 (2005)
Chen, K.: On k-Median clustering in high dimensions. In: Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, pp. 1177–1185 (2006)
Cormode, G., Muthukrishnan, S., Rozenbaum, I.: Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Sampling. DIMACS Technical Report 2005-11 (2005)
Feldman, D., Fiat, A., Sharir, M.: Coresets for Weighted Facilities and Their Applications. In: Proc. 47th FOCS, pp. 315–324 (2006)
Feldman, D., Monemizahdeh, M., Sohler, C.: A PTAS for k-means clustering based on weak coresets. In: Proc. 23rd SoCG, pp. 11–18 (2007)
Frahling, G., Indyk, P., Sohler, C.: Sampling in dynamic data streams and applications. In: Proc. 21st SoCG, pp. 142–149 (2005)
Frahling, G., Sohler, C.: Coresets in Dynamic Geometric Data Streams. In: Proc. 37th STOC, pp. 209–217 (2005)
Fotakis, D.: Memoryless facility location in one pass. In: STACS, pp. 608–620 (2006)
Ganguly, S.: Counting distinct items over update streams. Theoretical Computer Science 378(3), 211–222 (2007)
Har-Peled, S., Kushal, A.: Smaller coresets for k-median and k-means clustering. In: Proc. 21st SoCG, pp. 126–134 (2005)
Har-Peled, S., Mazumdar, S.: On coresets for k-means and k-median clustering. In: Proc. 36th STOC, pp. 291–300 (2004)
Indyk, P.: Algorithms for dynamic geometric problems over data streams. In: Proc. 36th STOC, pp. 373–380 (2004)
Meyerson, A.: Online Facility Location. In: Proc. 32nd FOCS, pp. 426–431 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lammersen, C., Sohler, C. (2008). Facility Location in Dynamic Geometric Data Streams. In: Halperin, D., Mehlhorn, K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-87744-8_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87743-1
Online ISBN: 978-3-540-87744-8
eBook Packages: Computer ScienceComputer Science (R0)