{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:27:37Z","timestamp":1742912857786,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819777976"},{"type":"electronic","value":"9789819777983"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-7798-3_12","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"133-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisit the\u00a0Online Facility Location Problem with\u00a0Uniform Facility Cost"],"prefix":"10.1007","author":[{"given":"Mengzhen","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Runjie","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenchen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"12_CR1","unstructured":"Almanza, M., Chierichetti, F., Lattanzi, S., Panconesi, A., Re, G.: Online facility location with multiple advice. Adv. Neural Inf. Proc. Syst. (2021)"},{"key":"12_CR2","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. 194, 175\u2013202 (2004)","journal-title":"Inf. Comput."},{"issue":"6","key":"12_CR3","doi-asserted-by":"publisher","first-page":"2212","DOI":"10.1137\/070708901","volume":"39","author":"J Byrka","year":"2010","unstructured":"Byrka, J., Aardal, K.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J. Comput. 39(6), 2212\u20132231 (2010)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"FA Chudak","year":"2003","unstructured":"Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33(1), 1\u201325 (2003)","journal-title":"SIAM J. Comput."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Di\u00b4veki, G., Imreh, C.: Online facility location with facility movements. Cent. Eur. J. Oper. Res. 19, 191\u2013200 (2011)","DOI":"10.1007\/s10100-010-0153-8"},{"issue":"1","key":"12_CR6","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 5(1), 141\u2013148 (2007)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"12_CR7","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. Algorithmica 50(1), 1\u201357 (2008)","journal-title":"Algorithmica"},{"issue":"1","key":"12_CR8","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. ACM SIGACT News 42(1), 97\u2013131 (2011)","journal-title":"ACM SIGACT News"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31(1), 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the 34th annual ACM Symposium on Theory of Computing, pp. 731\u2013740 (2002)","DOI":"10.1145\/509907.510012"},{"key":"12_CR11","unstructured":"Jiang, S.H.C., Liu, E., Lyu, Y., Tang Z.G., Zhang, Y.: Online facility location with predictions. In: Proceedings of the tenth International Conference on Learning Representations (2022)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Naori, D., Raz, D.: Almost tight bounds for online facility location in the random-order model. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1523\u20131544 (2023)","DOI":"10.1137\/1.9781611977554.ch56"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Li, S.: A 1.488 approximation algorithm for the uncapacitated facility location problem. Information and Computation, 222, 45\u201358 (2013)","DOI":"10.1016\/j.ic.2012.01.007"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/S0097539703435716","volume":"36","author":"M Mahdian","year":"2006","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Approximation algorithms for metric facility location problems. SIAM J. Comput. 36(2), 411\u2013432 (2006)","journal-title":"SIAM J. Comput."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Meyerson, A.: Online facility location. In: Proceedings of the 34th annual ACM Symposium on Theory of Computing, pp. 426\u2013431 (2001)","DOI":"10.1145\/380752.380756"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265-274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"12_CR17","unstructured":"Sviridenko, M.: cited as personal communication in [4] (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7798-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:06:46Z","timestamp":1726769206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7798-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819777976","9789819777983"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7798-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}