Title :
Suboptimal algorithm for a wire routing problem
Author :
Yang, Yi ; Wing, O.
fDate :
9/1/1972 12:00:00 AM
Abstract :
The wire routing problem in the layout of integrated circuits is formulated as Steiner´s problem in graphs. A suboptimal algorithm is described for the problem. The algorithm is based on the branch-and-bound method. The result of the algorithm applied to several examples is also described.
Keywords :
Integrated circuit layout; Layout, integrated circuits; Network topology; Trees; Circuit analysis; Circuit theory; Closed-form solution; Neodymium; Polynomials; Power system transients; Routing; Thin film circuits; Transmission line matrix methods; Wire;
Journal_Title :
Circuit Theory, IEEE Transactions on
DOI :
10.1109/TCT.1972.1083538
