<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>A tree structure for dynamic facility location</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LIPIcs</title>
</titleInfo>

<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Gramoz </namePart>
  <namePart type="family">Goranci</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Monika H</namePart>
  <namePart type="family">Henzinger</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">540c9bbd-f2de-11ec-812d-d04a5be85630</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-5008-6530</description></name>
<name type="personal">
  <namePart type="given">Dariusz</namePart>
  <namePart type="family">Leniowski</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>









<name type="conference">
  <namePart>ESA: Annual European Symposium on Algorithms</namePart>
</name>






<abstract lang="eng">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.</abstract>

<originInfo><publisher>Schloss Dagstuhl - Leibniz-Zentrum für Informatik</publisher><dateIssued encoding="w3cdtf">2018</dateIssued><place><placeTerm type="text">Helsinki, Finland</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>26th Annual European Symposium on Algorithms</title></titleInfo>
  <identifier type="issn">1868-8969</identifier>
  <identifier type="isbn">9783959770811</identifier>
  <identifier type="arXiv">1909.06653</identifier><identifier type="doi">10.4230/LIPICS.ESA.2018.39</identifier>
<part><detail type="volume"><number>112</number></detail>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<short>G. Goranci, M. Henzinger, D. Leniowski, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.</short>
<ista>Goranci G, Henzinger M, Leniowski D. 2018. A tree structure for dynamic facility location. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 39.</ista>
<ama>Goranci G, Henzinger M, Leniowski D. A tree structure for dynamic facility location. In: &lt;i&gt;26th Annual European Symposium on Algorithms&lt;/i&gt;. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:&lt;a href=&quot;https://doi.org/10.4230/LIPICS.ESA.2018.39&quot;&gt;10.4230/LIPICS.ESA.2018.39&lt;/a&gt;</ama>
<mla>Goranci, Gramoz, et al. “A Tree Structure for Dynamic Facility Location.” &lt;i&gt;26th Annual European Symposium on Algorithms&lt;/i&gt;, vol. 112, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:&lt;a href=&quot;https://doi.org/10.4230/LIPICS.ESA.2018.39&quot;&gt;10.4230/LIPICS.ESA.2018.39&lt;/a&gt;.</mla>
<ieee>G. Goranci, M. Henzinger, and D. Leniowski, “A tree structure for dynamic facility location,” in &lt;i&gt;26th Annual European Symposium on Algorithms&lt;/i&gt;, Helsinki, Finland, 2018, vol. 112.</ieee>
<chicago>Goranci, Gramoz , Monika Henzinger, and Dariusz Leniowski. “A Tree Structure for Dynamic Facility Location.” In &lt;i&gt;26th Annual European Symposium on Algorithms&lt;/i&gt;, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. &lt;a href=&quot;https://doi.org/10.4230/LIPICS.ESA.2018.39&quot;&gt;https://doi.org/10.4230/LIPICS.ESA.2018.39&lt;/a&gt;.</chicago>
<apa>Goranci, G., Henzinger, M., &amp;#38; Leniowski, D. (2018). A tree structure for dynamic facility location. In &lt;i&gt;26th Annual European Symposium on Algorithms&lt;/i&gt; (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. &lt;a href=&quot;https://doi.org/10.4230/LIPICS.ESA.2018.39&quot;&gt;https://doi.org/10.4230/LIPICS.ESA.2018.39&lt;/a&gt;</apa>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>11827</recordIdentifier><recordCreationDate encoding="w3cdtf">2022-08-12T08:20:57Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2024-11-06T11:57:41Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
