Rectilinear group Steiner trees and applications in VLSI design

Abstract. Given a set of disjoint groups of points in the plane, the rectilinear group Steiner tree problem is the problem of finding a shortest interconnection (under the rectilinear metric) which includes at least one point from each group. This is an important generalization of the well-known rectilinear Steiner tree problem which has direct applications in VLSI design: in the detailed routing phase the logical units typically allow the nets to connect to several electrically equivalent ports. We present a first (tailored) exact algorithm for solving the rectilinear group Steiner tree problem (and related variants of the problem). The algorithm essentially constructs a subgraph of the corresponding Hanan grid on which existing algorithms for solving the Steiner tree problem in graphs are applied. The reductions of the Hanan grid are performed by applying point deletions and by generating full Steiner trees on the remaining points. Experimental results for real-world VLSI instances with up to 100 groups are presented.

[1]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

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

[3]  E. Kleinberg,et al.  Approximation algorithms for set cover and related problems , 1998 .

[4]  Martin Zachariasen.  Rectilinear full Steiner tree generation , 1999 .

[5]  T. Koch,et al.  Solving Steiner Tree Problems in Graphs to Optimality , 1998 .

[6]  Majid Sarrafzadeh,et al.  An Introduction To VLSI Physical Design , 1996 .

[7]  Martin Grötschel,et al.  The steiner tree packing problem in VLSI design , 1997, Math. Program..

[8]  Jeffrey S. Salowe,et al.  Thirty-five-point rectilinear steiner minimal trees in a day , 1995, Networks.

[9]  Sudipto Guha,et al.  Rounding via Trees : Deterministic Approximation Algorithms forGroup , 1998 .

[10]  Edmund Ihler,et al.  Class Steiner Trees and VLSI-design , 1999, Discret. Appl. Math..

[11]  Joseph L. Ganley,et al.  Optimal Rectilinear Steiner Tree Routing in the Presence of Obstacles (supercedes CS-92-39, CS-93-15, and CS-93-19) , 1993 .

[12]  Marcus Poggi de Aragão,et al.  Vertex-disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-cut Implementation Issues , 1999 .

[13]  Martin Zachariasen,et al.  A catalog of Hanan grid problems , 2001, Networks.

[14]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[15]  Alex Zelikovsky,et al.  Provably good routing tree construction with multi-port terminals , 1997, ISPD '97.

[16]  Michel X. Goemans,et al.  A catalog of steiner tree formulations , 1993, Networks.

[17]  Martin Zachariasen,et al.  Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm , 1999, ALENEX.

[18]  Edmund Ihler,et al.  The rectilinear class Steiner tree problem for intervals on two parallel lines , 1994, Math. Program..

[19]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

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

[21]  Alex Zelikovsky,et al.  Improved approximation bounds for the group Steiner problem , 1998, Proceedings Design, Automation and Test in Europe.

[22]  Siavash Vahdati Daneshmand,et al.  Improved algorithms for the Steiner problem in networks , 2001, Discret. Appl. Math..

[23]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[24]  R. Ravi,et al.  An approximation algorithm for the covering Steiner problem , 2000, SODA '00.

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

[26]  Gabriele Reich,et al.  Beyond Steiner's Problem: A VLSI Oriented Generalization , 1989, WG.

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