Author:
Banik Aritra,Das Sandip,Maheshwari Anil,Smid Michiel
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Ahn, H.-K., Cheng, S.-W., Cheong, O., Golin, M.J., van Oostrum, R.: Competitive facility location: the Voronoi game. Theor. Comput. Sci. 310(1-3), 457–467 (2004)
2. Lecture Notes in Computer Science;S. Bandyapadhyay,2013
3. Banik, A., Bhattacharya, B.B., Das, S.: Optimal strategies for the one-round discrete Voronoi game on a line. Journal of Combinatorial Optimization, 1–15 (2012)
4. Bhattacharya, B.B., Nandy, S.C.: New variations of the maximum coverage facility location problem. European Journal of Operational Research 224(3), 477–485 (2013)
5. Cabello, S., Díaz-Báñez, 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 202(1), 99–106 (2010)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An exact method for the discrete $$(r|p)$$ ( r | p ) -centroid problem;Journal of Global Optimization;2013-12-21
2. Two-Round Discrete Voronoi Game along a Line;Frontiers in Algorithmics and Algorithmic Aspects in Information and Management;2013