Abstract
In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we developed and implemented for these two models. We report on computational experiments using standard test instances. Our codes are able to determine optimum solutions in most cases, and in particular, we can show that some of the instances have no feasible solution if Manhattan routing is used instead of knock-knee routing.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M.L. Brady and D.J. Brown, “VLSI routing: Four layers suffice,” in: F.P. Preparata, ed.,Advances in Computing Research, Vol. 2: VLSI theory (Jai Press, London, 1984) 245–258.
M. Burstein and R. Pelavin, “Hierarchical wire routing,”IEEE Transactions on Computer-Aided-Design CAD-2 (1983) 223–234.
M.R. Garey and D.S. Johnson, “The rectilinear Steiner tree problem isNP-complete,”SIAM J. Appl. Math. 32 (1977) 826–834.
J.P. Cohoon and P.L. Heck, “BEAVER: A computational-geometry-based tool for switchbox routing,”IEEE Transactions on Computer-Aided-Design CAD-7 (1988) 684–697.
S.H. Gerez and O.E. Herrmann, “Switchbox routing by stepwise reshaping,”IEEE Transactions on Computer-Aided-Design CAD-8 (1989) 1350–1361.
M. Grötschel and C.L. Monma, “Integer polyhedra associated with certain network design problems with connectivity constraints,”SIAM Journal on Discrete Mathematics 3 (1990) 502–523.
M. Grötschel, A. Martin and R. Weismantel, “Packing Steiner trees: polyhedral investigations,”Mathematical Programming 72 (1996) 101–124.
M. Grötschel, A. Martin and R. Weismantel, “Packing Steiner trees: a cutting plane algorithm and computational results,”Mathematical Programming 72 (1996) 125–146.
M. Grötschel, A. Martin and R. Weismantel, “Packing Steiner trees: separation algorithms,”SIAM Journal on Discrete Mathematics 9 (2) (1996) 233–257.
J.M. Jou, J.Y. Lee, Y. Sun and J.F. Wang, “An efficient VLSI switch-box router,”IEEE Design and Test (1990) 52–65.
R. Joobbani and D.P. Siewiorek, “WEAVER: A knowledge-based routing expert,”IEEE Design and Test (1986) 12–23.
R.M. Karp, “Reducibility among combinatorial problems,” in: R.E. Miller and J.W. Thatcher, eds.,Complexity of Computer Computations (Plenum Press, New York, 1972) 85–103.
T. Lengauer,Combinatorial algorithms for integrated circuit layout (Wiley, Chichester, 1990).
Y.L. Lin, Y.C. Hsu and F.S. Tsai, “A detailed router based on simulated evolution,” in:Proc. Int. Conf. Computer-Aided-Design, 1988, 38–41.
W. Lipski, “On the structure of three-layer wireable layouts,” F.P. Preparata, ed.,Advances in Computing Research, Vol. 2:VLSI theory (Jai Press, London, 1984) 231–244.
W.K. Luk, “A greedy switch-box router,”Integration 3 (1985) 129–149.
A. Martin, “Packen von Steinerbäumen: Polyedrische Studien und Anwendung,” Ph.D. Thesis, Technische Universität Berlin, 1992.
M. Sarrafzadeh, “Channel-routing problem in the knock-knee mode isNP-complete,”IEEE Transactions on Computer-Aided-Design CAD-6 (1987) 503–506.
T.G. Szymanski, “Dogleg channel routing isNP-complete,”IEEE Transactions on Computer-Aided-Design CAD-4 (1985) 31–40.
P. Tzeng and C.H. Séquin, “Codar: a congestion-directed general area router,” in:Proc. Int. Conf. Computer-Aided Design (1988) 30–33.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Grötschel, M., Martin, A. & Weismantel, R. The steiner tree packing problem in VLSI design. Mathematical Programming 78, 265–281 (1997). https://doi.org/10.1007/BF02614374
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02614374