---
res:
  bibo_abstract:
  - We study the metric facility location problem with client insertions and deletions.
    This setting differs from the classic dynamic facility location problem, where
    the set of clients remains the same, but the metric space can change over time.
    We show a deterministic algorithm that maintains a constant factor approximation
    to the optimal solution in worst-case time O~(2^{O(kappa^2)}) per client insertion
    or deletion in metric spaces while answering queries about the cost in O(1) time,
    where kappa denotes the doubling dimension of the metric. For metric spaces with
    bounded doubling dimension, the update time is polylogarithmic in the parameters
    of the problem.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: 'Gramoz '
      foaf_name: 'Goranci, Gramoz '
      foaf_surname: Goranci
  - foaf_Person:
      foaf_givenName: Monika H
      foaf_name: Henzinger, Monika H
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=540c9bbd-f2de-11ec-812d-d04a5be85630
    orcid: 0000-0002-5008-6530
  - foaf_Person:
      foaf_givenName: Dariusz
      foaf_name: Leniowski, Dariusz
      foaf_surname: Leniowski
  bibo_doi: 10.4230/LIPICS.ESA.2018.39
  bibo_volume: 112
  dct_date: 2018^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/1868-8969
  - http://id.crossref.org/issn/9783959770811
  dct_language: eng
  dct_publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik@
  dct_title: A tree structure for dynamic facility location@
...