Title :
A suboptimal algorithm for rectilinear Steiner problem
Author :
Ji, Yubo ; Liu, Meilun
Author_Institution :
Dept. of Comput. Eng., Fushun Pet. Inst., China
Abstract :
The new algorithm does not construct a Steiner tree as the result in one time, but first gets simply an initial tree and then concentrates on refining it. The time complexity and space complexity of the algorithm is low and the percentage of reduction in suboptimal Steiner tree length over minimum spanning tree length is high
Keywords :
computational complexity; network topology; trees (mathematics); initial tree; minimum spanning tree length; rectilinear Steiner problem; space complexity; suboptimal algorithm; time complexity; Approximation algorithms; Automation; Hydrogen; Petroleum; Shape; Steiner trees;
Conference_Titel :
Circuits and Systems, 1991. Conference Proceedings, China., 1991 International Conference on
Conference_Location :
Shenzhen
DOI :
10.1109/CICCAS.1991.184499
