Maximum Terminal Interconnection by a Given Length using Rectilinear Edge |
Kim, Minkwon
(School of Computer Science and Information Engineering, the Catholic University of Korea)
Kim, Yeonsoo (School of Computer Science and Information Engineering, the Catholic University of Korea) Kim, Hanna (School of Computer Science and Information Engineering, the Catholic University of Korea) Hwang, Byungyeon (School of Computer Science and Information Engineering, the Catholic University of Korea) |
1 | D. Hu, P. Dai, K. Zhou, and S. Ge, "Improved particle swarm optimization for minimum spanning tree of length constraint problem," in Proceeding of International Conference on Intelligent Computation Technology and Automation, Nanchang, pp. 474-477, 2015. DOI: 10.1109/icicta.2015.124. DOI |
2 | J. Kim, J. Oh, M. Kim, Y. Kim, J. Lee, S. Han, and B. Hwang, "Maximum node interconnection by a given sum of Euclidean edge lengths," Journal of information and communication convergence engineering, vol. 17, no. 4, pp. 246-254, 2019. DOI: 10.6109/jicce.2019.17.4.246. DOI |
3 | E. N. Gilbert and H. O. Pollak, "Steiner minimal trees." SIAM J. of Appl. Math., vol. 16. no. 1, pp. 1-29, 1968. DOI: 10.1137/0116001. DOI |
4 | C. N. Chu and Y. C. Wong, "FLUTE: Fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design," IEEE Trans. Computer-Aided Design Integrated Circuits Syst., vol. 27, no. 1, pp. 70-83, Jan. 2008. DOI: 10.1109/TCAD.2007.907068. DOI |
5 | X. Cheng and D. Du, Steiner trees in industry, Kluwer Academic Publishers, 2013. |
6 | M. Garey and D. S. Johnson, "The rectilinear Steiner tree Problem is NP complete," SIAM Journal of Applied Mathematics, vol. 32, no. 4, pp. 826-834, 1977. DOI: 10.1137/0132071. DOI |
7 | K. Zhou and J. Chen, "Simulation DNA algorithm of set covering problem," Applied Mathematics & Information Sciences, vol. 8, no. 1, pp. 139-144, Jan. 2014. DOI: 10.12785/amis/080117. DOI |
8 | G. Wei and X. Xie, "Research of using genetic algorithm of improvement to compute the most short path," in Proceeding of International Conference on Anti-counterfeiting, Security, and Identification in Communication, Hong Kong, pp. 516-519, 2009. DOI: 10.1109/ICASID.2009.5276990. DOI |
9 | F. K. Hwang, "On Steiner minimal trees with rectilinear distance," SIAM Journal of Applied Mathematics, vol. 30, no. 1, pp. 104-114, 1976. DOI: 10.1137/0130013. DOI |
10 | M. Hanan, "On Steiner's problem with rectilinear distance," SIAM Journal of Applied Mathematics, vol. 14, no. 2, pp. 255-265, 1966. DOI: 10.1137/0114025. DOI |
11 | R. L. Graham, "An efficient algorithm for determining the convex hull of a finite planar set," Information Processing Letter, vol. 1, no. 4, pp. 132-133, 1972. DOI: 10.1016/0020-0190(72)90045-2. DOI |