A new scheme for the Steiner problem in graphs

The Steiner problem in graphs has found important application in global and detailed routeing of integrated circuit layout. A scheme is described which does not immediately construct a tree, but first obtains an initial tree, and then concentrates on refining it. A loop method for refining is presented, and an algorithm is developed. The algorithm is of low time and space complexity, and experimental results show that it performs well.<>