{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:51:48Z","timestamp":1743090708043,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030682101"},{"type":"electronic","value":"9783030682118"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-68211-8_9","type":"book-chapter","created":{"date-parts":[[2021,2,18]],"date-time":"2021-02-18T23:20:57Z","timestamp":1613690457000},"page":"103-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0548-4086","authenticated-orcid":false,"given":"Thomas","family":"Byrne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9062-4241","authenticated-orcid":false,"given":"S\u00e1ndor P.","family":"Fekete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5013-3448","authenticated-orcid":false,"given":"J\u00f6rg","family":"Kalcsics","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3786-916X","authenticated-orcid":false,"given":"Linda","family":"Kleist","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,16]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.tcs.2003.09.004","volume":"310","author":"HK Ahn","year":"2004","unstructured":"Ahn, H.K., Cheng, S.W., Cheong, O., Golin, M., van Oostrum, R.: Competitive facility location: the Voronoi game. Theoret. Comput. Sci. 310, 357\u2013372 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR2","unstructured":"Aurenhammer, F., Klein, R.: Voronoi diagrams. In: Handbook of Computational Geometry, vol. 5, no. 10, pp. 201\u2013290 (2000)"},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1287\/opre.2015.1354","volume":"62","author":"I Averbakh","year":"2015","unstructured":"Averbakh, I., Berman, O., Kalcsics, J., Krass, D.: Structural properties of Voronoi diagrams in facility location problems with continuous demand. Oper. Res. 62(2), 394\u2013411 (2015)","journal-title":"Oper. Res."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.tcs.2014.10.003","volume":"562","author":"S Bandyapadhyay","year":"2015","unstructured":"Bandyapadhyay, S., Banik, A., Das, S., Sarkar, H.: Voronoi game on graphs. Theor. Comput. Sci. 562, 270\u2013282 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR5","unstructured":"Banik, A., Bhattacharya, B.B., Das, S., Mukherjee, S.: One-round discrete Voronoi game in $$\\mathbb{R}^2$$ in presence of existing facilities. In: CCCG (2013)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Byrne, T., Fekete, S.P., Kalcsics, J., Kleist, L.: Competitive facility location: balanced facility location and the one-round Manhattan Voronoi game. arXiv:2011.13275 (2020)","DOI":"10.1007\/978-3-030-68211-8_9"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00454-003-2951-4","volume":"31","author":"O Cheong","year":"2004","unstructured":"Cheong, O., Har-Peled, S., Linial, N., Matousek, J.: The one-round Voronoi game. Discrete Comput. Geom. 31(1), 125\u2013138 (2004). https:\/\/doi.org\/10.1007\/s00454-003-2951-4","journal-title":"Discrete Comput. Geom."},{"key":"9_CR8","series-title":"Springer Series in Operations Research","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5355-6","volume-title":"Facility Location: A Survey of Applications and Methods","author":"Z Drezner","year":"1995","unstructured":"Drezner, Z.: Facility Location: A Survey of Applications and Methods. Springer Series in Operations Research. Springer, New York (1995)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-75520-3_4","volume-title":"Algorithms \u2013 ESA 2007","author":"C D\u00fcrr","year":"2007","unstructured":"D\u00fcrr, C., Thang, N.K.: Nash equilibria in Voronoi games on graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 17\u201328. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_4"},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.tcs.2002.12.001","volume":"313","author":"SP Fekete","year":"2004","unstructured":"Fekete, S.P., Fleischer, R., Fraenkel, A.S., Schmitt, M.: Traveling salesmen in the presence of competition. Theoret. Comput. Sci. 313(3), 377\u2013392 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.comgeo.2004.05.005","volume":"30","author":"SP Fekete","year":"2005","unstructured":"Fekete, S.P., Meijer, H.: The one-round Voronoi game replayed. Comput. Geom. Theory Appl. 30(2), 81\u201394 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/opre.1040.0137","volume":"53","author":"SP Fekete","year":"2005","unstructured":"Fekete, S.P., Mitchell, J.S.B., Beurer, K.: On the continuous Fermat-Weber problems. Oper. Res. 53, 61\u201376 (2005)","journal-title":"Oper. Res."},{"key":"9_CR13","unstructured":"Gerbner, D., M\u00e9sz\u00e1ros, V., P\u00e1lv\u00f6lgyi, D., Pokrovskiy, A., Rote, G.: Advantage in the discrete Voronoi game. arXiv preprint:1303.0523 (2013)"},{"issue":"6","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1587\/transinf.E94.D.1185","volume":"94","author":"M Kiyomi","year":"2011","unstructured":"Kiyomi, M., Saitoh, T., Uehara, R.: Voronoi game on a path. IEICE Trans. Inf. Syst. 94(6), 1185\u20131189 (2011)","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1287\/opre.29.3.616","volume":"29","author":"A Kolen","year":"1981","unstructured":"Kolen, A.: Equivalence between the direct search approach and the cut approach to the rectilinear distance location problem. Oper. Res. 29(3), 616\u2013620 (1981)","journal-title":"Oper. Res."},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-63890-3_35","volume-title":"Algorithms and Computation","author":"Y Kusakari","year":"1997","unstructured":"Kusakari, Y., Nishizeki, T.: An algorithm for finding a region with the minimum total L1 from prescribed terminals. In: Leong, H.W., Imai, H., Jain, S. (eds.) ISAAC 1997. LNCS, vol. 1350, pp. 324\u2013333. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63890-3_35"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-32177-2_1","volume-title":"Location Science","author":"G Laporte","year":"2019","unstructured":"Laporte, G., Nickel, S., Saldanha-da-Gama, F.: Introduction to location science. In: Laporte, G., Nickel, S., Saldanha da Gama, F. (eds.) Location Science, pp. 1\u201321. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32177-2_1"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Teramoto, S., Demaine, E.D., Uehara, R.: Voronoi game on graphs and its complexity. In: CIG, pp. 265\u2013271 (2006)","DOI":"10.1109\/CIG.2006.311711"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800180107","volume":"18","author":"GO Wesolowsky","year":"1971","unstructured":"Wesolowsky, G.O., Love, R.F.: Location of facilities with rectangular distances among point and area destinations. Nav. Res. Log. Q. 18, 83\u201390 (1971)","journal-title":"Nav. Res. Log. Q."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68211-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T15:31:28Z","timestamp":1619278288000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68211-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030682101","9783030682118"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68211-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yangon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Myanmar","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uit.edu.mm\/walcom-2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","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":"24","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":"40% - 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":"1,8","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)"}},{"value":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}