{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T13:48:45Z","timestamp":1779889725388,"version":"3.53.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-022-01193-y","type":"journal-article","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T17:08:03Z","timestamp":1652980083000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithmic Study of Online Multi-Facility Location Problems"],"prefix":"10.1007","volume":"3","author":[{"given":"Christine","family":"Markarian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdul-Nasser","family":"Kassar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manal","family":"Yunis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,5,19]]},"reference":[{"issue":"4","key":"1193_CR1","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1007\/s10878-015-9915-5","volume":"32","author":"S Abshoff","year":"2016","unstructured":"Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards the price of leasing online. J Comb Optim. 2016;32(4):1197\u2013216.","journal-title":"J Comb Optim"},{"key":"1193_CR2","doi-asserted-by":"crossref","unstructured":"Alon N, Awerbuch B, Azar Y. The online set cover problem. In Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, STOC \u201903, pa 100\u2013105, New York, NY, USA, 2003. ACM.","DOI":"10.1145\/780555.780558"},{"issue":"4","key":"1193_CR3","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/1198513.1198522","volume":"2","author":"N Alon","year":"2006","unstructured":"Alon N, Awerbuch B, Azar Y, Buchbinder N, Naor JS. A general approach to online network optimization problems. ACM Trans Algorithms. 2006;2(4):640\u201360.","journal-title":"ACM Trans Algorithms"},{"issue":"2","key":"1193_CR4","doi-asserted-by":"publisher","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. A simple and deterministic competitive algorithm for online facility location. Inf Comput. 2004;194(2):175\u2013202.","journal-title":"Inf Comput"},{"issue":"1","key":"1193_CR5","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.tcs.2007.10.047","volume":"393","author":"P Berman","year":"2008","unstructured":"Berman P, DasGupta B. Approximating the online set multicover problems via randomized winnowing. Theor Comput Sci. 2008;393(1):54\u201371.","journal-title":"Theor Comput Sci"},{"key":"1193_CR6","doi-asserted-by":"crossref","unstructured":"Bienkowski M, Kraska A, Schmidt P. A deterministic algorithm for online steiner tree leasing. In: Ellen F, Kolokolova A, Sack J-R, editors. Algorithms and Data Structures. pp. Cham: Springer International Publishing; 2017. p. 169\u201380.","DOI":"10.1007\/978-3-319-62127-2_15"},{"key":"1193_CR7","doi-asserted-by":"crossref","unstructured":"Byrka J, Srinivasan A, Swamy C. Fault-tolerant facility location: A randomized dependent lp-rounding algorithm. In Eisenbrand F, Shepherd FB, editors, Integer Programming and Combinatorial Optimization, pp 244\u2013257, 2010. Springer, Berlin.","DOI":"10.1007\/978-3-642-13036-6_19"},{"issue":"04","key":"1193_CR8","doi-asserted-by":"publisher","first-page":"1750022","DOI":"10.1142\/S0219091517500229","volume":"20","author":"C Cotei","year":"2017","unstructured":"Cotei C, Farhat J. The leasing decisions of startup firms. Rev Pac Basin Financ Mark Policies. 2017;20(04):1750022.","journal-title":"Rev Pac Basin Financ Mark Policies"},{"key":"1193_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.endm.2017.10.039","volume":"62","author":"MS de Lima","year":"2017","unstructured":"de Lima MS, Felice MCS, Lee O. On generalizations of the parking permit problem and network leasing problems. Electron Notes Discrete Math. 2017;62:225\u201330.","journal-title":"Electron. Notes Discrete. Math."},{"issue":"2","key":"1193_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10100-010-0153-8","volume":"19","author":"G Div\u00e9ki","year":"2011","unstructured":"Div\u00e9ki G, Imreh C. Online facility location with facility movements. CEJOR. 2011;19(2):191\u2013200.","journal-title":"CEJOR"},{"key":"1193_CR11","unstructured":"Drezner Z. Facility Location - A Survey of Applications and Methods. Springer Series in Operations Research and Financial Engineering, 1995."},{"key":"1193_CR12","doi-asserted-by":"crossref","unstructured":"Feige U. A threshold of ln n for approximating set cover. J. ACM, 1998;45(4):634\u2013652.","DOI":"10.1145\/285055.285059"},{"key":"1193_CR13","doi-asserted-by":"crossref","unstructured":"Feldkord B, Markarian C, Meyer auf der Heide F. Price fluctuation in online leasing. In International Conference on Combinatorial Optimization and Applications, pp 17\u201331. Springer, 2017.","DOI":"10.1007\/978-3-319-71147-8_2"},{"key":"1193_CR14","doi-asserted-by":"crossref","unstructured":"Feldkord B, Meyer auf der Heide F. Online facility location with mobile facilities. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA \u201918, pp 373-381, New York, NY, USA, 2018. Association for Computing Machinery.","DOI":"10.1145\/3210377.3210389"},{"key":"1193_CR15","doi-asserted-by":"crossref","unstructured":"Fiat A, Woeginger GJ. Online algorithms: The state of the art, 1998;1442. Springer.","DOI":"10.1007\/BFb0029561"},{"issue":"1","key":"1193_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.jda.2006.03.001","volume":"5","author":"D Fotakis","year":"2007","unstructured":"Fotakis D. A primal-dual algorithm for online non-uniform facility location. J Discrete Algorithms. 2007;5(1):141\u20138.","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"1193_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-9049-y","volume":"50","author":"D Fotakis","year":"2008","unstructured":"Fotakis D. On the competitive ratio for online facility location. Algorithms. 2008;50(1):1\u201357.","journal-title":"Algorithms"},{"issue":"1","key":"1193_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/1959045.1959065","volume":"42","author":"D Fotakis","year":"2011","unstructured":"Fotakis D. Online and incremental algorithms for facility location. SIGACT News. 2011;42(1):97\u2013131.","journal-title":"SIGACT News"},{"key":"1193_CR19","doi-asserted-by":"crossref","unstructured":"Gerodimos A. The Journal of the Operational Research Society. 1998;49(12):1303\u20134.","DOI":"10.1057\/palgrave.jors.2600043"},{"key":"1193_CR20","unstructured":"Hamann H, Markarian C, auf der Heide FM, Wahby M. Pick, pack, & survive: Charging robots in a modern warehouse based on online connected dominating sets. In Ito H, Leonardi S, Pagli L, Prencipe G, editors, 9th International Conference on Fun with Algorithms, FUN 2018, June 13-15, 2018, La Maddalena, Italy, volume 100 of LIPIcs, pp 22:1\u201322:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2018."},{"issue":"1","key":"1193_CR21","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1086\/324387","volume":"110","author":"I Hendel","year":"2002","unstructured":"Hendel I, Lizzeri A. The role of leasing under adverse selection. J Polit Econ. 2002;110(1):113\u201343.","journal-title":"J Polit Econ"},{"issue":"3","key":"1193_CR22","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson DS. Approximation algorithms for combinatorial problems. J Comput Syst Sci. 1974;9(3):256\u201378.","journal-title":"J Comput Syst Sci"},{"key":"1193_CR23","unstructured":"Korman S. On the use of randomization in the online set cover problem. Master\u2019s thesis, Weizmann Institute of Science, Israel, 2005."},{"issue":"2","key":"1193_CR24","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1111\/1468-036X.00062","volume":"4","author":"MA Lasfer","year":"1998","unstructured":"Lasfer MA, Levis M. The determinants of the leasing decision of small and large companies. Eur Financ Manag. 1998;4(2):159\u201384.","journal-title":"Eur Financ Manag"},{"issue":"5","key":"1193_CR25","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1007\/s00453-018-0420-y","volume":"80","author":"S Li","year":"2018","unstructured":"Li S, Markarian C, Meyer Auf Der Heide F. Towards flexible demands in online leasing problems. Algorithmica. 2018;80(5):1556\u201374.","journal-title":"Algorithmica"},{"issue":"2","key":"1193_CR26","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1287\/mnsc.11.2.213","volume":"11","author":"AS Manne","year":"1964","unstructured":"Manne AS. Plant location under economies-of-scale-decentralization and computation. Manag Sci. 1964;11(2):213\u201335.","journal-title":"Manag Sci"},{"key":"1193_CR27","doi-asserted-by":"crossref","unstructured":"Markarian C. Leasing with uncertainty. In Operations Research Proceedings 2017, pp 429\u2013434. Springer, 2018.","DOI":"10.1007\/978-3-319-89920-6_57"},{"key":"1193_CR28","doi-asserted-by":"crossref","unstructured":"Markarian C. An optimal algorithm for online prize-collecting node-weighted steiner forest. In Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, 16-19, 2018, Proceedings, pp 214 \u2013 223, 2018.","DOI":"10.1007\/978-3-319-94667-2_18"},{"key":"1193_CR29","doi-asserted-by":"crossref","unstructured":"Markarian C, Kassar A, Yunis MM. An algorithmic approach to online multi-facility location problems. In Parlier GH, Liberatore F, Demange M, editors, Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, ICORES 2021, Online Streaming, 4-6, 2021, pp 29\u201335. SCITEPRESS, 2021.","DOI":"10.5220\/0010212200290035"},{"key":"1193_CR30","doi-asserted-by":"crossref","unstructured":"Markarian C, Kassar A-N. Online deterministic algorithms for connected dominating set & set cover leasing problems. In International Conference on Operations Research and Enterprise Systems (ICORES), pp 121\u2013128, 2020.","DOI":"10.5220\/0008866701210128"},{"key":"1193_CR31","doi-asserted-by":"crossref","unstructured":"Markarian C, Khallouf P. Online facility service leasing inspired by the COVID-19 pandemic. In Gusikhin O, Nijmeijer H, Madani K, editors, Proceedings of the 18th International Conference on Informatics in Control, Automation and Robotics, ICINCO 2021, Online Streaming, 6-8, 2021, pages 195\u2013202. SCITEPRESS, 2021.","DOI":"10.5220\/0010572601950202"},{"key":"1193_CR32","doi-asserted-by":"crossref","unstructured":"Markarian C, Meyer auf\u00a0der Heide F. Online algorithms for leasing vertex cover and leasing non-metric facility location. In Parlier GH, Liberatore F, Demange M, editors, Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, ICORES 2019, Prague, Czech Republic, 19-21, 2019, pp 315\u2013321. SciTePress, 2019.","DOI":"10.5220\/0007369503150321"},{"key":"1193_CR33","doi-asserted-by":"crossref","unstructured":"Meyerson A. Online facility location. In Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp 426 \u2013 431. IEEE, 2001.","DOI":"10.1109\/SFCS.2001.959917"},{"key":"1193_CR34","doi-asserted-by":"crossref","unstructured":"Meyerson A. The parking permit problem. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201905), pp 274\u2013282. IEEE, 2005.","DOI":"10.1109\/SFCS.2005.72"},{"key":"1193_CR35","doi-asserted-by":"crossref","unstructured":"San Felice MC, Williamson DP, Lee O. The online connected facility location problem. In Pardo A, Viola A, editors, LATIN 2014: Theoretical Informatics, pp 574\u2013585, 2014. Springer, Berlin.","DOI":"10.1007\/978-3-642-54423-1_50"},{"issue":"7","key":"1193_CR36","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1080\/07408170500216480","volume":"38","author":"LV Snyder","year":"2006","unstructured":"Snyder LV. Facility location under uncertainty: a review. IIE Trans. 2006;38(7):547\u201364.","journal-title":"IIE Trans"},{"issue":"11","key":"1193_CR37","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1080\/07408170500469113","volume":"38","author":"LV Snyder","year":"2006","unstructured":"Snyder LV, Daskin MS. Stochastic p-robust location problems. IIE Trans. 2006;38(11):971\u201385.","journal-title":"IIE Trans"},{"key":"1193_CR38","unstructured":"Virkumar VV. Approximation Algorithms. Springer, New York, 2001."},{"issue":"11","key":"1193_CR39","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.ipl.2011.03.005","volume":"111","author":"L Yan","year":"2011","unstructured":"Yan L, Chrobak M. Approximation algorithms for the fault-tolerant facility placement problem. Inf Process Lett. 2011;111(11):545\u20139.","journal-title":"Inf Process Lett"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01193-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01193-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01193-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T12:10:42Z","timestamp":1744200642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01193-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,19]]},"references-count":39,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["1193"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01193-y","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,19]]},"assertion":[{"value":"16 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"296"}}