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 logO(1) Δ time to process an insertion or deletion of a point, uses log O(1) Δ bits of storage, and has a failure probability of 1/Δ Θ(1). © 2008 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Lammersen, C., & Sohler, C. (2008). Facility location in dynamic geometric data streams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 660–671). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_55
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
