{"extern":"1","type":"conference","date_updated":"2023-02-16T10:50:51Z","volume":112,"publication_identifier":{"isbn":["9783959770811"],"issn":["1868-8969"]},"alternative_title":["LIPIcs"],"_id":"11827","doi":"10.4230/LIPICS.ESA.2018.39","author":[{"last_name":"Goranci","full_name":"Goranci, Gramoz ","first_name":"Gramoz "},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"first_name":"Dariusz","full_name":"Leniowski, Dariusz","last_name":"Leniowski"}],"conference":{"start_date":"2018-08-20","end_date":"2018-08-22","name":"ESA: Annual European Symposium on Algorithms","location":"Helsinki, Finland"},"article_number":"39","abstract":[{"lang":"eng","text":"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."}],"publication_status":"published","publication":"26th Annual European Symposium on Algorithms","article_processing_charge":"No","month":"08","date_created":"2022-08-12T08:20:57Z","citation":{"ieee":"G. Goranci, M. H. Henzinger, and D. Leniowski, “A tree structure for dynamic facility location,” in <i>26th Annual European Symposium on Algorithms</i>, Helsinki, Finland, 2018, vol. 112.","short":"G. Goranci, M.H. Henzinger, D. Leniowski, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ama":"Goranci G, Henzinger MH, Leniowski D. A tree structure for dynamic facility location. In: <i>26th Annual European Symposium on Algorithms</i>. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.39\">10.4230/LIPICS.ESA.2018.39</a>","mla":"Goranci, Gramoz, et al. “A Tree Structure for Dynamic Facility Location.” <i>26th Annual European Symposium on Algorithms</i>, vol. 112, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.39\">10.4230/LIPICS.ESA.2018.39</a>.","apa":"Goranci, G., Henzinger, M. H., &#38; Leniowski, D. (2018). A tree structure for dynamic facility location. In <i>26th Annual European Symposium on Algorithms</i> (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.39\">https://doi.org/10.4230/LIPICS.ESA.2018.39</a>","ista":"Goranci G, Henzinger MH, 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.","chicago":"Goranci, Gramoz , Monika H Henzinger, and Dariusz Leniowski. “A Tree Structure for Dynamic Facility Location.” In <i>26th Annual European Symposium on Algorithms</i>, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2018.39\">https://doi.org/10.4230/LIPICS.ESA.2018.39</a>."},"external_id":{"arxiv":["1909.06653"]},"status":"public","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"intvolume":"       112","quality_controlled":"1","scopus_import":"1","title":"A tree structure for dynamic facility location","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2018.39"}],"oa_version":"Published Version","day":"14","year":"2018","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2018-08-14T00:00:00Z"}