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.

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithmica
Hlavní autoři: Henzinger, Monika, Leniowski, Dariusz, Mathieu, Claire
Médium: Journal Article
Jazyk:angličtina
Vydáno: Springer Verlag 2020
Témata:
Computer Science
Data Structures and Algorithms
doubling dimension
approximation
clustering
phrases dynamic algorithm
ISSN:0178-4617, 1432-0541
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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