The Discrete and Mixed Minimax 2-Center Problem
暂无分享,去创建一个
Yin-Feng Xu | Binhai Zhu | Yi Xu | Jigen Peng
[1] Timothy M. Chan. More planar two-center algorithms , 1999, Comput. Geom..
[2] Micha Sharir,et al. The Discrete 2-Center Problem , 1998, Discret. Comput. Geom..
[3] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[4] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[5] Sandip Das,et al. Base station placement on boundary of a convex polygon , 2008, J. Parallel Distributed Comput..
[6] Binhai Zhu,et al. Streaming with minimum space: An algorithm for covering by two congruent balls , 2012, Theor. Comput. Sci..
[7] Chak-Kuen Wong,et al. Minimum Diameter Spanning Trees and Related Problems , 1991, SIAM J. Comput..
[8] Micha Sharir. A Near-Linear Algorithm for the Planar 2-Center Problem , 1997, Discret. Comput. Geom..
[9] Jerzy W. Jaromczyk,et al. An efficient algorithm for the Euclidean two-center problem , 1994, SCG '94.
[10] Nimrod Megiddo,et al. On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..
[11] David Eppstein,et al. Faster construction of planar two-centers , 1997, SODA '97.
[12] Subhash Suri,et al. Finding Tailored Partitions , 1991, J. Algorithms.
[13] Timothy M. Chan. Semi-online maintenance of geometric optima and measures , 2002, SODA '02.