{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T05:18:00Z","timestamp":1772860680215,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10100-010-0153-8","type":"journal-article","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T11:41:41Z","timestamp":1277898101000},"page":"191-200","source":"Crossref","is-referenced-by-count":18,"title":["Online facility location with facility movements"],"prefix":"10.1007","volume":"19","author":[{"given":"Gabriella","family":"Div\u00e9ki","sequence":"first","affiliation":[]},{"given":"Csan\u00e1d","family":"Imreh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,7,1]]},"reference":[{"issue":"2","key":"153_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ic.2004.06.002","volume":"194","author":"A Anagnostopoulos","year":"2004","unstructured":"Anagnostopoulos A, Bent R, Upfal E, Van Hentenryck P (2004) A simple and deterministic competitive algorithm for online facility location. Inf Comput 194(2): 175\u2013202","journal-title":"Inf Comput"},{"key":"153_CR2","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"issue":"2","key":"153_CR3","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0377-2217(82)90160-6","volume":"10","author":"N Christofides","year":"1982","unstructured":"Christofides N, Beasley JE (1982) A tree search algorithm for the p-median problem. Eur J Oper Res 10(2): 196\u2013204","journal-title":"Eur J Oper Res"},{"issue":"6","key":"153_CR4","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D Erlenkotter","year":"1978","unstructured":"Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26(6): 992\u20131009","journal-title":"Oper Res"},{"key":"153_CR5","volume-title":"Online algorithms: the state of the art, LNCS 1442","year":"1998","unstructured":"Fiat, A, Woeginger, GJ (eds) (1998) Online algorithms: the state of the art, LNCS 1442. Springer, Berlin"},{"key":"153_CR6","first-page":"102","volume":"3111","author":"R Fleischer","year":"2004","unstructured":"Fleischer R, Golin MJ, Yan Z (2004) Online maintenance of k-medians and k-covers on a line. Proc SWAT 2004 Springer LNCS 3111: 102\u2013113","journal-title":"Proc SWAT 2004 Springer LNCS"},{"key":"153_CR7","doi-asserted-by":"crossref","unstructured":"Fotakis D (2006) Incremental algorithms for facility location and k-median. Theor Comput Sci 361:275\u2013313 (preliminary version appeared at the proccedings of ESA 04, LNCS 3221)","DOI":"10.1016\/j.tcs.2006.05.015"},{"key":"153_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.jda.2006.03.001","volume":"5","author":"D Fotakis","year":"2006","unstructured":"Fotakis D (2006) A primal-dual algorithm for online non-uniform facility location. J Discret Algorithms 5: 141\u2013148","journal-title":"J Discret Algorithms"},{"key":"153_CR9","doi-asserted-by":"crossref","unstructured":"Fotakis D (2006) Memoryless facility location in one pass. In: Proceedings of STACS \u201906, LNCS 3884, pp 608\u2013620","DOI":"10.1007\/11672142_50"},{"key":"153_CR10","doi-asserted-by":"crossref","unstructured":"Fotakis D (2008) On the competitive ratio for online facility location. Algorithmica 50(1):1\u201357 (preliminary version appeared at the proceedings of ICALP \u201903, LNCS 2719)","DOI":"10.1007\/s00453-007-9049-y"},{"key":"153_CR11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/trsc.8.3.217","volume":"8","author":"RS Garfinkel","year":"1974","unstructured":"Garfinkel RS, Neebe AW, Rao MR (1974) An algorithm for the M-median plant location problem. Transp Sci 8: 217\u2013231","journal-title":"Transp Sci"},{"key":"153_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0167-6377(91)90041-M","volume":"10","author":"R Hassin","year":"1991","unstructured":"Hassin R, Tamir A (1991) Improved complexity bounds for location problems on the real line. Oper Res Lett 10: 395\u2013402","journal-title":"Oper Res Lett"},{"key":"153_CR13","unstructured":"Imreh Cs (2007) Competitive analysis. In: Iv\u00e1nyi A (ed) Algorithms of Informatics, vol 1. mondAt, Budapest, pp 395\u2013428"},{"key":"153_CR14","doi-asserted-by":"crossref","unstructured":"Meyerson A (2001) Online facility location. In: Prooceedings of FOCS 2001, pp 426\u2013431","DOI":"10.1109\/SFCS.2001.959917"},{"key":"153_CR15","doi-asserted-by":"crossref","unstructured":"Shmoys D (2000) Approximation algorithms for facility location problems. In: Proceedings of 3rd international workshop of approximation algorithms for combinatorial optimization, Springer LNCS, vol 1913, pp 27\u201333","DOI":"10.1007\/3-540-44436-X_4"},{"key":"153_CR16","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/11671541_10","volume":"3484","author":"R Solis-Oba","year":"2006","unstructured":"Solis-Oba R (2006) Approximation algorithms for the k-median problem. Effic Approx Online Algorithms LNCS 3484: 292\u2013320","journal-title":"Effic Approx Online Algorithms LNCS"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-010-0153-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-010-0153-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-010-0153-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:42:08Z","timestamp":1559230928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-010-0153-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,1]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["153"],"URL":"https:\/\/doi.org\/10.1007\/s10100-010-0153-8","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,1]]}}}