One-Round Discrete Voronoi Game in ℝ2 in Presence of Existing Facilities
暂无分享,去创建一个
[1] Stefan Langerman,et al. Optimization in Arrangements , 2003, STACS.
[2] J. Matou Sek,et al. Computing the center of planar point sets , 1991 .
[3] Sandip Das,et al. Optimal strategies for the one-round discrete Voronoi game on a line , 2013, J. Comb. Optim..
[4] Jirí Matousek. Computing the Center of Planar Point Sets , 1990, Discrete and Computational Geometry.
[5] Christoph Dürr,et al. Nash Equilibria in Voronoi Games on Graphs , 2007, ESA.
[6] Sayan Bandyapadhyay,et al. Voronoi game on graphs , 2015, Theor. Comput. Sci..
[7] Boris Aronov,et al. On approximating the depth and related problems , 2005, SODA '05.
[8] Erik D. Demaine,et al. Voronoi game on graphs and its complexity , 2006, 2006 IEEE Symposium on Computational Intelligence and Games.
[9] Jirí Matousek,et al. The one-round Voronoi game , 2002, SCG '02.
[10] Stefan Langerman,et al. Facility location problems in the plane based on reverse nearest neighbor queries , 2010, Eur. J. Oper. Res..
[11] Michiel H. M. Smid,et al. The Discrete Voronoi Game in a Simple Polygon , 2013, COCOON.
[12] Toshiki Saitoh,et al. Voronoi Game on a Path , 2011, IEICE Trans. Inf. Syst..
[13] Otfried Cheong,et al. Competitive facility location: the Voronoi game , 2004, Theor. Comput. Sci..
[14] Sándor P. Fekete,et al. The One-Round Voronoi Game Replayed , 2003, WADS.