The connected disk covering problem
暂无分享,去创建一个
Wencheng Wang | Binhai Zhu | Yi Xu | Jigen Peng | Jigen Peng | Wencheng Wang | B. Zhu | Yi Xu
[1] Weili Wu,et al. Minimum connected dominating sets and maximal independent sets in unit disk graphs , 2006, Theor. Comput. Sci..
[2] 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).
[3] Zvi Drezner,et al. The p-Centre Problem—Heuristic and Optimal Algorithms , 1984 .
[4] Sandip Das,et al. Variations of Base-Station Placement Problem on the Boundary of a Convex Region , 2008, Int. J. Found. Comput. Sci..
[5] Richard C. T. Lee,et al. The slab dividing approach to solve the EuclideanP-Center problem , 2005, Algorithmica.
[6] Tomás Feder,et al. Optimal algorithms for approximate clustering , 1988, STOC '88.
[7] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..
[8] Nimrod Megiddo,et al. On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..
[9] Kun-Mao Chao,et al. Computing the Line-Constrained k-center in the Plane for Small k , 2016, AAIM.
[10] Mohammad Hossein Fazel Zarandi,et al. Facility location via fuzzy modeling and simulation , 2011, Appl. Soft Comput..
[11] Sandip Das,et al. Some variations on constrained minimum enclosing circle problem , 2013, J. Comb. Optim..
[12] Yin-Feng Xu,et al. An approximation algorithm for k-center problem on a convex polygon , 2014, J. Comb. Optim..
[13] Sandip Das,et al. Efficient algorithm for placing a given number of base stations to cover a convex region , 2006, J. Parallel Distributed Comput..
[14] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..
[15] Loren Schwiebert,et al. Power efficient topologies for wireless sensor networks , 2001, International Conference on Parallel Processing, 2001..
[16] David B. Shmoys,et al. A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..