{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:55:20Z","timestamp":1742972120111,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389054"},{"type":"electronic","value":"9783031389061"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38906-1_20","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"291-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Bounds for\u00a0Discrete Voronoi Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5770-3784","authenticated-orcid":false,"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2650-638X","authenticated-orcid":false,"given":"Geert","family":"van Wordragen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-44679-6_26","volume-title":"Computing and Combinatorics","author":"H-K Ahn","year":"2001","unstructured":"Ahn, H.-K., Cheng, S.-W., Cheong, O., Golin, M., van Oostrum, R.: Competitive facility location along a highway. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 237\u2013246. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44679-6_26"},{"issue":"5","key":"20_CR2","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.comgeo.2008.02.005","volume":"42","author":"B Aronov","year":"2009","unstructured":"Aronov, B., et al.: Small weak epsilon-nets. Comput. Geom. 42(5), 455\u2013462 (2009). https:\/\/doi.org\/10.1016\/j.comgeo.2008.02.005","journal-title":"Comput. Geom."},{"key":"20_CR3","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). https:\/\/doi.org\/10.1016\/j.tcs.2014.10.003","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s10878-011-9447-6","volume":"26","author":"A Banik","year":"2012","unstructured":"Banik, A., Bhattacharya, B.B., Das, S.: Optimal strategies for the one-round discrete Voronoi game on a line. J. Comb. Optim. 26(4), 655\u2013669 (2012). https:\/\/doi.org\/10.1007\/s10878-011-9447-6","journal-title":"J. Comb. Optim."},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.comgeo.2016.02.002","volume":"55","author":"A Banik","year":"2016","unstructured":"Banik, A., Carufel, J.D., Maheshwari, A., Smid, M.H.M.: Discrete Voronoi games and $$\\epsilon $$-nets, in two and three dimensions. Comput. Geom. 55, 41\u201358 (2016). https:\/\/doi.org\/10.1016\/j.comgeo.2016.02.002","journal-title":"Comput. Geom."},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"de Berg, M., Gudmundsson, J., Mehr, M.: Faster algorithms for computing plurality points. ACM Trans. Algorithms 14(3), 36:1\u201336:23 (2018). https:\/\/doi.org\/10.1145\/3186990","DOI":"10.1145\/3186990"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"de Berg, M., Kisfaludi-Bak, S., Mehr, M.: On one-round discrete Voronoi games. In: Proceedings of the 30th International Symposium on Algorithms and Computation (ISAAC 2019). LIPIcs, vol. 149, pp. 37:1\u201337:17 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2019.37","DOI":"10.4230\/LIPIcs.ISAAC.2019.37"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Bukh, B.: A point in many triangles. Electron. J. Comb. 13(1) (2006). http:\/\/www.combinatorics.org\/Volume_13\/Abstracts\/v13i1n10.html","DOI":"10.37236\/1148"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-68211-8_9","volume-title":"WALCOM: Algorithms and Computation","author":"T Byrne","year":"2021","unstructured":"Byrne, T., Fekete, S.P., Kalcsics, J., Kleist, L.: Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game. In: Uehara, R., Hong, S.-H., Nandy, S.C. (eds.) WALCOM 2021. LNCS, vol. 12635, pp. 103\u2013115. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68211-8_9"},{"key":"20_CR10","unstructured":"Chan, T.M.: An optimal randomized algorithm for maximum Tukey depth. In: Munro, J.I. (ed.) Proceedings 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 430\u2013436 (2004). http:\/\/dl.acm.org\/citation.cfm?id=982792.982853"},{"issue":"5","key":"20_CR11","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.orl.2005.10.002","volume":"34","author":"S Chawla","year":"2006","unstructured":"Chawla, S., Rajan, U., Ravi, R., Sinha, A.: Min-max payoffs in a two-player location game. Oper. Res. Lett. 34(5), 499\u2013507 (2006). https:\/\/doi.org\/10.1016\/j.orl.2005.10.002","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00454-003-2951-4","volume":"31","author":"O Cheong","year":"2003","unstructured":"Cheong, O., Har-Peled, S., Linial, N., Matousek, J.: The one-round Voronoi game. Discret. Comput. Geom. 31(1), 125\u2013138 (2003). https:\/\/doi.org\/10.1007\/s00454-003-2951-4","journal-title":"Discret. Comput. Geom."},{"key":"20_CR13","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":"2","key":"20_CR14","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1287\/moor.1.2.144","volume":"1","author":"RD McKelvey","year":"1976","unstructured":"McKelvey, R.D., Wendell, R.E.: Voting equilibria in multidimensional choice spaces. Math. Oper. Res. 1(2), 144\u2013158 (1976)","journal-title":"Math. Oper. Res."},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.comgeo.2007.10.004","volume":"42","author":"NH Mustafa","year":"2009","unstructured":"Mustafa, N.H., Ray, S.: An optimal extension of the centerpoint theorem. Comput. Geom. 42, 505\u2013510 (2009). https:\/\/doi.org\/10.1016\/j.comgeo.2007.10.004","journal-title":"Comput. Geom."},{"key":"20_CR16","doi-asserted-by":"publisher","unstructured":"Teramoto, S., Demaine, E.D., Uehara, R.: Voronoi game on graphs and its complexity. In: 2006 IEEE Symposium on Computational Intelligence and Games, pp. 265\u2013271 (2006). https:\/\/doi.org\/10.1109\/CIG.2006.311711","DOI":"10.1109\/CIG.2006.311711"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/978-3-642-45030-3_64","volume-title":"Algorithms and Computation","author":"Y-W Wu","year":"2013","unstructured":"Wu, Y.-W., Lin, W.-Y., Wang, H.-L., Chao, K.-M.: Computing plurality points and Condorcet points in Euclidean space. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 688\u2013698. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45030-3_64"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:07:25Z","timestamp":1690474045000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","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":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","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":"92","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":"47","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":"51% - 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.1","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":"10","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)"}}]}}