{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:25:16Z","timestamp":1743020716654,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496134"},{"type":"electronic","value":"9783031496141"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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-3-031-49614-1_23","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"310-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Facility Assignment for\u00a0General Layout of\u00a0Servers on\u00a0a\u00a0Line"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8101-4153","authenticated-orcid":false,"given":"Tsubasa","family":"Harada","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3706-2163","authenticated-orcid":false,"given":"Toshiya","family":"Itoh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.tcs.2019.08.011","volume":"806","author":"AR Ahmed","year":"2020","unstructured":"Ahmed, A.R., Rahman, M.S., Kobourov, S.: Online facility assignment. Theor. Comput. Sci. 806, 455\u2013467 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-319-77404-6_5","volume-title":"LATIN 2018: Theoretical Informatics","author":"A Antoniadis","year":"2018","unstructured":"Antoniadis, A., Fischer, C., T\u00f6nnis, A.: A collection of lower bounds for online matching on the line. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 52\u201365. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_5"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/978-3-540-75520-3_47","volume-title":"Algorithms \u2013 ESA 2007","author":"N Bansal","year":"2007","unstructured":"Bansal, N., Buchbinder, N., Gupta, A., Naor, J.S.: An O(log2k)-Competitive Algorithm for Metric Bipartite Matching. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 522\u2013533. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_47"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-78773-0_20","volume-title":"LATIN 2008: Theoretical Informatics","author":"C Chung","year":"2008","unstructured":"Chung, C., Pruhs, K., Uthaisombut, P.: The online transportation problem: on the exponential boost of one extra server. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 228\u2013239. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78773-0_20"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-31594-7_36","volume-title":"Automata, Languages, and Programming","author":"A Gupta","year":"2012","unstructured":"Gupta, A., Lewi, K.: The online metric matching problem for doubling metrics. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 424\u2013435. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31594-7_36"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Harada, T., Itoh, T., Miyazaki, S.: Capacity-insensitive algorithms for online facility assignment problems on a line. online ready in discrete mathematics, algorithms and applications (2023)","DOI":"10.1142\/S179383092350057X"},{"issue":"06","key":"23_CR7","doi-asserted-by":"publisher","first-page":"2150156","DOI":"10.1142\/S1793830921501561","volume":"13","author":"T Itoh","year":"2021","unstructured":"Itoh, T., Miyazaki, S., Satake, M.: Competitive analysis for two variants of online metric matching problem. Discrete Math. Algorithms Appl. 13(06), 2150156 (2021)","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1006\/jagm.1993.1026","volume":"14","author":"B Kalyanasundaram","year":"1993","unstructured":"Kalyanasundaram, B., Pruhs, K.: Online weighted matching. J. Algorithms 14(3), 478\u2013488 (1993)","journal-title":"J. Algorithms"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0029573","volume-title":"Online Algorithms","author":"B Kalyanasundaram","year":"1998","unstructured":"Kalyanasundaram, B., Pruhs, K.: On-line network optimization problems. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms. LNCS, vol. 1442, pp. 268\u2013280. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0029573"},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1137\/S0895480198342310","volume":"13","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.R.: The online transportation problem. SIAM J. Discret. Math. 13(3), 370\u2013383 (2000)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0304-3975(94)90042-6","volume":"127","author":"S Khuller","year":"1994","unstructured":"Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-line algorithms for weighted bipartite matching and stable marriages. Theoret. Comput. Sci. 127(2), 255\u2013267 (1994)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"23_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3594873","volume":"19","author":"E Peserico","year":"2023","unstructured":"Peserico, E., Scquizzato, M.: Matching on the line admits no $$o(\\sqrt{\\log n})$$-competitive algorithm. ACM Trans. Algorithms 19(3), 1\u20134 (2023)","journal-title":"ACM Trans. Algorithms"},{"key":"23_CR13","unstructured":"Raghvendra, S.: A robust and optimal online algorithm for minimum metric bipartite matching. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2016). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"23_CR14","unstructured":"Raghvendra, S.: Optimal analysis of an online algorithm for the bipartite matching problem on a line. In: 34th International Symposium on Computational Geometry (SoCG 2018). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2018)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49614-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:04:51Z","timestamp":1707555891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49614-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496134","9783031496141"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49614-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}