{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:21:15Z","timestamp":1726410075011},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22685-4_19","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T08:54:39Z","timestamp":1312966479000},"page":"213-224","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Strategies for the One-Round Discrete Voronoi Game on a Line"],"prefix":"10.1007","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","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","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.: Competitive facility location: the Voronoi game. Theor. Comput. Sci.\u00a0310, 457\u2013467 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"19_CR2","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10852-010-9142-0","volume":"9","author":"B.B. Bhattacharya","year":"2010","unstructured":"Bhattacharya, B.B.: Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location. J. Math. Model. Algor.\u00a09(4), 375\u2013392 (2010)","journal-title":"J. Math. Model. Algor."},{"key":"19_CR3","unstructured":"Bhattacharya, B.B., Nandy, S.C.: New variations of the reverse facility location problem. In: Proc. 22nd Canadian Conference on Computational Geometry, pp. 241\u2013244 (2010)"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","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.: Facility location problems in the plane based on reverse nearest neighbor queries. Eur. J. Operations Research\u00a0202(1), 99\u2013106 (2010)","journal-title":"Eur. J. Operations Research"},{"key":"19_CR5","doi-asserted-by":"publisher","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.: On finding a guard that sees most and a shop that sells most. Discrete Computational Geometry\u00a037, 545\u2013563 (2007)","journal-title":"Discrete Computational Geometry"},{"issue":"1","key":"19_CR6","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., Matou\u015dek, J.: The one-round Voronoi game. Discrete and Computational Geometry\u00a031(1), 125\u2013138 (2004)","journal-title":"Discrete and Computational Geometry"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1142\/S0218195905001786","volume":"15","author":"F. Dehne","year":"2005","unstructured":"Dehne, F., Klein, R., Seidel, R.: Maximizing a Voronoi region: the convex case. Int. Journal of Computational Geometry and Applications\u00a015, 463\u2013475 (2005)","journal-title":"Int. Journal of Computational Geometry and Applications"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(89)90161-6","volume":"39","author":"H.A. Eiselt","year":"1989","unstructured":"Eiselt, H.A., Laporte, G.: Competitive spatial models. Eur. J. Operations Research\u00a039, 231\u2013242 (1989)","journal-title":"Eur. J. Operations Research"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/trsc.27.1.44","volume":"27","author":"H.A. Eiselt","year":"1993","unstructured":"Eiselt, H.A., Laporte, G., Thisse, J.F.: Competitive location models: A framework and bibliography. Transportation Science\u00a027, 44\u201354 (1993)","journal-title":"Transportation Science"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.comgeo.2004.05.005","volume":"30","author":"S.P. Fekete","year":"2005","unstructured":"Fekete, S.P., Meijer, H.: The one-round Voronoi game replayed. Comput. Geom. Theory Appl.\u00a030(2), 81\u201394 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"47-49","key":"19_CR11","doi-asserted-by":"publisher","first-page":"5128","DOI":"10.1016\/j.tcs.2009.08.020","volume":"410","author":"J. Spoerhase","year":"2009","unstructured":"Spoerhase, J., Wirth, H.-C.: (r, p)-centroid problems on paths and trees. Theor. Comput. Sci.\u00a0410(47-49), 5128\u20135137 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02097808","volume":"18","author":"R. Tobin","year":"1989","unstructured":"Tobin, R., Friesz, T., Miller, T.: Existence theory for spatially competitive network facility location models. Annals of Operations Research\u00a018, 267\u2013276 (1989)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T08:56:57Z","timestamp":1554022617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}