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.

Saved in:
Bibliographic Details
Published in:Algorithmica
Main Authors: Henzinger, Monika, Leniowski, Dariusz, Mathieu, Claire
Format: Journal Article
Language:English
Published: Springer Verlag 2020
Subjects:
Computer Science
Data Structures and Algorithms
doubling dimension
approximation
clustering
phrases dynamic algorithm
ISSN:0178-4617, 1432-0541
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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