Routing through a generalized switchbox
We present an algorithm for the routing problem for two-terminal nets in generalized switchboxes. A generalized switchbox is any subset R of the planar rectangular grid with no non-trivial holes, i.e. every finite face has exactly four incident vertices. A net is a pair of nodes of non-maximal degree on the boundary of R. A solution is a set of edge-disjoint paths, one for each net.
Our algorithm solves generalized switchbox routing problems in time O(n(log n)2) where n is the number of vertices of R, i.e. it either finds a solution or indicates that there is none.
Unable to display preview. Download preview PDF.
- M. Becker/K. Mehlhorn: “Routing and Edge-disjoint paths in planar graphs” Technical report, FB 10, Universität des Saarlandes, Aug. 1984Google Scholar
- M. Brady/D. Brown: “VLSI Routing: Four Layers Suffice” MIT VLSI conference, 1984Google Scholar
- A. Frank: “Disjoint Paths in Rectilinear Grids” Combinatorica 2, 4 (1982), 361–371Google Scholar
- M. Kaufmann/K. Mehlhorn: “Local Routing of two-terminal Nets is easy” Technical report, FB 10, Universität des Saarlandes, Okt. 1984Google Scholar
- M.R. Kramer/J. van Leeuwen”: “Wire Routing is NP-complete” Technical Report RUU-CS-82-4, 1982, UtrechtGoogle Scholar
- K. Mehlhorn/F. Preparata: “Routing Through a Rectangle” Technical Report, 1983Google Scholar
- H. Okamura/P.D. Seymour: “Multicommodity flows in planar graphs” Journal of Combinatorial Theory, Series B, 1981, 75–81Google Scholar
- F. Preparata/W. Lipski: “Three Layers are Enough” 23rd FOCS 1982, 350–357Google Scholar