A tree structure for dynamic facility location

In this paper, we study the problem of dynamic facility location. We maintain a solution with cost O(1) times the cost of an optimal solution in metric spaces with bounded doubling dimension. The amortized update time is polylogarithmic in the parameters of the problem.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Algorithmica
Hauptverfasser: Henzinger, Monika, Leniowski, Dariusz, Mathieu, Claire
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Springer Verlag 2020
Schlagworte:
Computer Science
Data Structures and Algorithms
doubling dimension
approximation
clustering
phrases dynamic algorithm
ISSN:0178-4617, 1432-0541
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we study the problem of dynamic facility location. We maintain a solution with cost O(1) times the cost of an optimal solution in metric spaces with bounded doubling dimension. The amortized update time is polylogarithmic in the parameters of the problem.
ISSN:0178-4617
1432-0541
DOI:10.48550/arXiv.1909.06653