Unconstrained multilayer switchbox routing

Consider the gradually more and more complexproblems of single row routing, channel routing and switchbox routing on the one hand, and the gradually less and less restrictivemodels (1-layer, Manhattan, unconstrained 2-layer, multilayer) on the other hand. The single row routing problems can always be solved in the Manhattan model, and the channel routing problem can always be solved in the unconstrained 2-layer model, in fact, both in linear time. In this paper, we show that the switchbox routing problem is solvable in the multilayer model, also in linear time.

[1]  Malgorzata Marek-Sadowska,et al.  General channel-routing algorithm , 1983 .

[2]  András Recski,et al.  Vertex Disjoint Channel Routing on Two Layers , 1990, IPCO.

[3]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[4]  D. A. Mlynski,et al.  Automatic multilayer routing for surface mounted technology , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[5]  Susanne E. Hambrusch.  Channel Routing Algorithms for Overlap Models , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Frank Wagner,et al.  The VLSI layout in various embedding models , 1990, WG.

[7]  András Recski,et al.  Minimax Results and Polynomial Algorithms in VLSI Routing , 1992 .

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