{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:52:51Z","timestamp":1725583971933},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_22","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"210-220","source":"Crossref","is-referenced-by-count":1,"title":["Two-Round Discrete Voronoi Game along a Line"],"prefix":"10.1007","author":[{"given":"Aritra","family":"Banik","sequence":"first","affiliation":[]},{"given":"Bhaswar B.","family":"Bhattacharya","sequence":"additional","affiliation":[]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[]},{"given":"Sreeja","family":"Das","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"22_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.J., van Oostrum, R.: Competitive facility location: the Voronoi game. Theor. Comput. Sci.\u00a0310(1-3), 457\u2013467 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-36065-7_9","volume-title":"WALCOM: Algorithms and Computation","author":"S. Bandyapadhyay","year":"2013","unstructured":"Bandyapadhyay, S., Banik, A., Das, S., Sarkar, H.: Voronoi Game on Graphs. In: Ghosh, S.K., Tokuyama, T. (eds.) WALCOM 2013. LNCS, vol.\u00a07748, pp. 77\u201388. Springer, Heidelberg (2013)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Banik, A., Bhattacharya, B.B., Das, S.: Optimal strategies for the one-round discrete Voronoi game on a line. Journal of Combinatorial Optimization, 1\u201315 (2012)","DOI":"10.1007\/s10878-011-9447-6"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-642-38768-5_19","volume-title":"COCOON 2013","author":"A. Banik","year":"2013","unstructured":"Banik, A., Das, S., Maheshwari, A., Smid, M.: The discrete voronoi game in a simple polygon. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol.\u00a07936, pp. 197\u2013207. Springer, Heidelberg (2013)"},{"issue":"4","key":"22_CR5","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. Algorithms\u00a09(4), 375\u2013392 (2010)","journal-title":"J. Math. Model. Algorithms"},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.ejor.2012.08.009","volume":"224","author":"B.B. Bhattacharya","year":"2013","unstructured":"Bhattacharya, B.B., Nandy, S.C.: New variations of the maximum coverage facility location problem. European Journal of Operational Research\u00a0224(3), 477\u2013485 (2013)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"22_CR7","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., D\u00edaz-B\u00e1\u00f1ez, J.M., Langerman, S., Seara, C., Ventura, I.: Facility location problems in the plane based on reverse nearest neighbor queries. European Journal of Operational Research\u00a0202(1), 99\u2013106 (2010)","journal-title":"European Journal of Operational Research"},{"key":"22_CR8","first-page":"1098","volume-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004","author":"O. Cheong","year":"2004","unstructured":"Cheong, O., Efrat, A., Har-Peled, S.: On finding a guard that sees most and a shop that sells most. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pp. 1098\u20131107. Society for Industrial and Applied Mathematics, Philadelphia (2004)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Cheong, O., Linial, N., Har-peled, S.: The one-round Voronoi game. Discrete Comput. Geom., 97\u2013101 (2002)","DOI":"10.1145\/513400.513413"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Dehne, F., Klein, R., Seidel, R.: Maximizing a Voronoi region: The convex case. In: Proc. 13th Annu. Internat. Sympos. Algorithms Comput., pp. 624\u2013634 (2005)","DOI":"10.1007\/3-540-36136-7_54"},{"issue":"2","key":"22_CR11","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.\u00a030(2), 81\u201394 (2005)","journal-title":"Comput. Geom."},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Teramoto, S., Demaine, E.D., Uehara, R.: Voronoi game on graphs and its complexity. In: Louis, S.J., Kendall, G. (eds.) CIG, pp. 265\u2013271. IEEE (2006)","DOI":"10.1109\/CIG.2006.311711"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T13:01:49Z","timestamp":1645102909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}
