Efficient and Stable Fully Dynamic Facility Location

TL;DR

This paper introduces a new algorithm for the fully dynamic facility location problem that maintains a high-quality solution with minimal update time and recourse, validated by theoretical and experimental results.

Contribution

It presents the first algorithm achieving constant approximation and polylogarithmic amortized recourse in fully dynamic data streams for facility location.

Findings

Algorithm maintains constant approximation ratio.

Algorithm achieves polylogarithmic amortized recourse.

Experimental results confirm practical efficiency.

Abstract

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.