# Efficient and Stable Fully Dynamic Facility Location

arXiv: https://arxiv.org/abs/2210.13880 · HTML: https://mlsanity.com/paper/2210.13880/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Oct 2022.

## Built on by (most cited first, 3 of 3)

- [Consistent Submodular Maximization](https://mlsanity.com/paper/2405.19977/) (2024)
- [Dynamic algorithms for k-center on graphs](https://mlsanity.com/paper/2307.15557/) (2023)
- [Clustering with Label Consistency](https://mlsanity.com/paper/2512.19654/) (2025)

## Abstract (arXiv)

We consider the classic facility location problem in fully dynamic data streams, where elements can be both inserted and deleted. In this problem, one is interested in maintaining a stable and high quality solution throughout the data stream while using only little time per update (insertion or deletion). We study the problem and provide the first algorithm that at the same time maintains a constant approximation and incurs polylogarithmic amortized recourse per update. We complement our theoretical results with an experimental analysis showing the practical efficiency of our method.