G-Tree: Gravitation-direction-based rectilinear Steiner minimal tree construction considering bend reduction
暂无分享,去创建一个
[1] M. Hanan,et al. On Steiner’s Problem with Rectilinear Distance , 1966 .
[2] Alex Zelikovsky,et al. An 11/6-approximation algorithm for the network steiner problem , 1993, Algorithmica.
[3] Yu Hu,et al. ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm , 2006, Journal of Computer Science and Technology.
[4] D. Roller,et al. Cad , 2020, Perspektiven der Informatik.
[5] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.
[6] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.
[7] Dan Suciu,et al. Journal of the ACM , 2006 .