A new class of iterative Steiner tree heuristics with good performance

A fast approach to the minimum rectilinear Steiner tree (MRST) problem is presented. The method yields results that reduce wire length by up to 2% to 3% over the previous methods, and is the first heuristic which has been shown to have a performance ratio less than 3/2; in fact, the performance ratio is less than or equal to 4/3 on the entire class of instances where the ratio c(MST)/c(MRST) is exactly equal to 3/2. The algorithm has practical asymptotic complexity owing to an elegant implementation which uses methods from computation geometry and which parallelizes readily. A randomized variation of the algorithm, along with a batched variant, has also proved successful. >

[1]  G. Vijayan,et al.  A neighborhood improvement algorithm for rectilinear Steiner trees , 1990, IEEE International Symposium on Circuits and Systems.

[2]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[3]  Andrew B. Kahng,et al.  A new class of Steiner tree heuristics with good performance: the iterated 1-Steiner approach , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[4]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[5]  Carl Sechen,et al.  VLSI Placement and Global Routing Using Simulated Annealing , 1988 .

[6]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[7]  Der-Tsai Lee,et al.  An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem , 1980 .

[8]  Chak-Kuen Wong,et al.  New algorithms for the rectilinear Steiner tree problem , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  F. Hwang.  On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[10]  J. Steele.  Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted Edges , 1988 .

[11]  J. MacGregor Smith,et al.  STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN , 1979 .

[12]  David Eppstein,et al.  Maintenance of a minimum spanning forest in a dynamic planar graph , 1990, SODA '90.

[13]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

[14]  Christos H. Papadimitriou,et al.  The 1-Steiner Tree Problem , 1987, J. Algorithms.

[15]  Yu-Chin Hsu,et al.  Rectilinear Steiner tree construction by local and global refinement , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[16]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[17]  Chao Ting-Hai,et al.  Rectilinear Steiner tree construction by local and global refinement , 1990, ICCAD 1990.

[18]  Chak-Kuen Wong,et al.  Hierarchical Steiner tree construction in uniform orientations , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  David S. Johnson,et al.  The Rectilinear Steiner Problem is NP-Complete , 1977 .

[20]  Marshall W. Bern,et al.  Two probabilistic results on rectilinear steiner trees , 1986, STOC '86.

[21]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .