RSMT-MR: A novel RSMT algorithm

The rectilinear Steiner minimum tree (RSMT) problem is one of the fundamental problems in electronic design automation. In this paper, we present a new heuristic algorithm called RSMT-MR for RSMT problem. There are two steps in the algorithm: MergeEdges and Refinement. Experiment results show that our algorithm is accurate and effective.

[1]  Chris C. N. Chu,et al.  Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design , 2005, ISPD '05.

[2]  Benny K. Nielsen,et al.  An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem , 2002, ESA.

[3]  Dana S. Richards.  Fast heuristic algorithms for rectilinear steiner trees , 2005, Algorithmica.

[4]  Andrew B. Kahng,et al.  A new class of iterative Steiner tree heuristics with good performance , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Jeffrey S. Salowe,et al.  Closing the gap: near-optimal Steiner trees in polynomial time , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Andrew B. Kahng,et al.  Highly scalable algorithms for rectilinear and octilinear Steiner trees , 2003, ASP-DAC '03.

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

[8]  Mary Jane Irwin,et al.  An edge-based heuristic for Steiner routing , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

[11]  David M. Warme,et al.  Exact Algorithms for Plane Steiner Tree Problems: A Computational Study , 2000 .

[12]  Yiyu Shi,et al.  Circuit simulation based obstacle-aware Steiner routing , 2006, 2006 43rd ACM/IEEE Design Automation Conference.