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.

Podrobná bibliografia

Vydané v:	Algorithmica
Hlavní autori:	Henzinger, Monika, Leniowski, Dariusz, Mathieu, Claire
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Springer Verlag 2020
Predmet:	Computer Science Data Structures and Algorithms doubling dimension approximation clustering phrases dynamic algorithm
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!