Efficient and Stable Fully Dynamic Facility Location

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.

[1]  Shi Li,et al.  Consistent k-Median: Simpler, Better and Robust , 2020, AISTATS.

[2]  Silvio Lattanzi,et al.  Fully Dynamic Algorithm for Constrained Submodular Optimization , 2020, Neural Information Processing Systems.

[3]  Nikos Parotsidis,et al.  Fully Dynamic Consistent Facility Location , 2019, NeurIPS.

[4]  Dariusz Leniowski,et al.  A Tree Structure For Dynamic Facility Location , 2019, ESA.

[5]  Silvio Lattanzi,et al.  Consistent Online Optimization: Convex and Submodular , 2019, AISTATS.

[6]  Piotr Sankowski,et al.  Online Facility Location with Deletions , 2018, ESA.

[7]  T.-H. Hubert Chan,et al.  Fully Dynamic k-Center Clustering , 2018, WWW.

[8]  Silvio Lattanzi,et al.  Consistent k-Clustering , 2017, ICML.

[9]  Claire Mathieu,et al.  Dynamic Clustering to Minimize the Sum of Radii , 2017, Algorithmica.

[10]  Amit Kumar,et al.  Online and dynamic algorithms for set cover , 2016, STOC.

[11]  Artur Czumaj,et al.  (1+ Є)-approximation for facility location in data streams , 2013, SODA.

[12]  Shi Li,et al.  A 1.488 approximation algorithm for the uncapacitated facility location problem , 2011, Inf. Comput..

[13]  Christian Sohler,et al.  Facility Location in Dynamic Geometric Data Streams , 2008, ESA.

[14]  Piotr Indyk,et al.  Algorithms for dynamic geometric problems over data streams , 2004, STOC '04.

[15]  Dimitris Fotakis,et al.  On the Competitive Ratio for Online Facility Location , 2003, Algorithmica.

[16]  Evangelos Markakis,et al.  Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.

[17]  Adam Meyerson,et al.  Online facility location , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[18]  Salvatore J. Stolfo,et al.  Cost-based modeling for fraud and intrusion detection: results from the JAM project , 2000, Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00.

[19]  Ron Kohavi,et al.  Scaling Up the Accuracy of Naive-Bayes Classifiers: A Decision-Tree Hybrid , 1996, KDD.

[20]  Dariusz Leniowski,et al.  Fully Dynamic k-Center Clustering in Low Dimensional Metrics , 2021, ALENEX.

[21]  Janardhan Kulkarni,et al.  On the Facility Location Problem in Online and Dynamic Models , 2020, APPROX-RANDOM.

[22]  Thierry Bertin-Mahieux,et al.  The Million Song Dataset , 2011, ISMIR.

[23]  Samir Khuller,et al.  Greedy strikes back: improved facility location algorithms , 1998, SODA '98.