{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:57Z","timestamp":1759638537884},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,1,20]],"date-time":"2012-01-20T00:00:00Z","timestamp":1327017600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10878-011-9447-6","type":"journal-article","created":{"date-parts":[[2012,1,19]],"date-time":"2012-01-19T18:19:52Z","timestamp":1326997192000},"page":"655-669","source":"Crossref","is-referenced-by-count":13,"title":["Optimal strategies for the one-round discrete Voronoi game on a line"],"prefix":"10.1007","volume":"26","author":[{"given":"Aritra","family":"Banik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhaswar B.","family":"Bhattacharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,20]]},"reference":[{"key":"9447_CR1","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.tcs.2003.09.004","volume":"310","author":"H-K Ahn","year":"2004","unstructured":"Ahn H-K, Cheng S-W, Cheong O, Golin M, van Oostrum R (2004) Competitive facility location: the Voronoi game. Theor Comput Sci 310:457\u2013467","journal-title":"Theor Comput Sci"},{"issue":"4","key":"9447_CR2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10852-010-9142-0","volume":"9","author":"BB Bhattacharya","year":"2010","unstructured":"Bhattacharya BB (2010) Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location. J Math Model Algorithms 9(4):375\u2013392","journal-title":"J Math Model Algorithms"},{"key":"9447_CR3","first-page":"241","volume-title":"Proc 22nd Canadian conference on computational geometry","author":"BB Bhattacharya","year":"2010","unstructured":"Bhattacharya BB, Nandy SC (2010) New variations of the reverse facility location problem. In: Proc 22nd Canadian conference on computational geometry, pp 241\u2013244"},{"issue":"1","key":"9447_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.ejor.2009.04.021","volume":"202","author":"S Cabello","year":"2010","unstructured":"Cabello S, Miguel Di\u00e1z-B\u00e1\u00f1ez J, Langerman S, Seara C, Ventura I (2010) Facility location problems in the plane based on reverse nearest neighbor queries. Eur J Oper Res 202(1):99\u2013106","journal-title":"Eur J Oper Res"},{"key":"9447_CR5","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s00454-007-1328-5","volume":"37","author":"O Cheong","year":"2007","unstructured":"Cheong O, Efrat A, Har-Peled S (2007) On finding a guard that sees most and a shop that sells most. Discrete Comput Geom 37:545\u2013563","journal-title":"Discrete Comput Geom"},{"issue":"1","key":"9447_CR6","doi-asserted-by":"crossref","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, Matou\u015dek J (2004) The one-round Voronoi game. Discrete Comput Geom 31(1):125\u2013138","journal-title":"Discrete Comput Geom"},{"key":"9447_CR7","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1142\/S0218195905001786","volume":"15","author":"F Dehne","year":"2005","unstructured":"Dehne F, Klein R, Seidel R (2005) Maximizing a Voronoi region: the convex case. Int J Comput Geom Appl 15:463\u2013475","journal-title":"Int J Comput Geom Appl"},{"key":"9447_CR8","volume-title":"Facility location: applications and theory","year":"2002","unstructured":"Drezner Z, Hamacher HW (eds) (2002) Facility location: applications and theory. Springer, Berlin"},{"key":"9447_CR9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(89)90161-6","volume":"39","author":"HA Eiselt","year":"1989","unstructured":"Eiselt HA, Laporte G (1989) Competitive spatial models. Eur J Oper Res 39:231\u2013242","journal-title":"Eur J Oper Res"},{"key":"9447_CR10","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/trsc.27.1.44","volume":"27","author":"HA Eiselt","year":"1993","unstructured":"Eiselt HA, Laporte G, Thisse JF (1993) Competitive location models: a\u00a0framework and bibliography. Transp Sci 27:44\u201354","journal-title":"Transp Sci"},{"issue":"2","key":"9447_CR11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.comgeo.2004.05.005","volume":"30","author":"SP Fekete","year":"2005","unstructured":"Fekete SP, Meijer H (2005) The one-round Voronoi game replayed. Comput Geom Theory Appl 30(2):81\u201394","journal-title":"Comput Geom Theory Appl"},{"issue":"47\u201349","key":"9447_CR12","doi-asserted-by":"crossref","first-page":"5128","DOI":"10.1016\/j.tcs.2009.08.020","volume":"410","author":"J Spoerhase","year":"2009","unstructured":"Spoerhase J, Wirth H-C (2009) (r,p)-centroid problems on paths and trees. Theor Comput Sci 410(47\u201349):5128\u20135137","journal-title":"Theor Comput Sci"},{"key":"9447_CR13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF02097808","volume":"18","author":"R Tobin","year":"1989","unstructured":"Tobin R, Friesz T, Miller T (1989) Existence theory for spatially competitive network facility location models. Ann Oper Res 18:267\u2013276","journal-title":"Ann Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9447-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9447-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9447-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:17Z","timestamp":1559276597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9447-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,20]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["9447"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9447-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,20]]}}}