Abstract
We showed that the local routing problem for two-terminal nets is solvable in quadratic time. There are three major open problems:
-
1)
Allow more general routing regions than grid graphs. In particular, prove a similar result for arbitrary planar graphs.
-
2)
Extend the result to nets with more than two terminals.
-
3)
Improve the running time. This question is adressed in the first author's Ph.D. thesis where an alternative and considerably more complex implementation with running time O(n log n) will be described.
Extended abstract
This work was supported by the DFG, SFB 124, TP B2, VLSI Entwurf und Parallelität. A full version of this paper is available from the authors.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
VI. References
M. Brady/D. Brown: “VLSI Routing: Four Layers Suffice”, MIT VLSI Conference 1984
M. Becker/K. Mehlhorn: “Algorithms for Routing in Planar Graphs”, Technical Report, FB 10, Universität des Saarlandes, August 1984
R. Cole/A. Siegel: “River Routing Every Which Way, but Loose”, 25th FOCS, 65–73
A. Frank: “Disjoint Paths in Rectilinear Grids”, Combinatorica 2, 4 (1982), 361–371
C. van Hoesel/A. Schrijver: “Edge-disjoint Homotopic Paths in a Planar Graph with One Hole”, Technical Report, Amsterdam 1986
M. Kaufmann/K. Mehlhorn: “Generalized Switchbox Routing”, Technical Report, FB 10, Universität des Saarlandes, 1984
M. E. Kramer/J. van Leeuwen: “Wire Routing is NP-complete”, Technical Report RUU-CS-82-4, 1982, Utrecht
U. Lauther: “The SIEMENS CALCOS System for Computer Aided Design of Cell Based IC Layout”, Proc. 1st ICCC, 1980, pp 768–771
Ch. Leiserson/F. Miller Maley: “Algorithms for Routing and Testing Routability of Planar VLSI Layouts”, 17th STOC 85
K. Matsumoto/T. Nishizeki/N. Saito: “An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks”, SICOMP, Vol 15:2 (1986), 495–510
K. Mehlhorn/F. Preparata: “Routing through a Rectangle”, JACM 1986, Vol 33, 60–85
T. Nishizeki/N. Saito/K. Suzuki: “A linear-time routing algorithm for convex grids”, IEEE Transactions on Computer Aided Design, CAD-4, 68–76, 1985
H. Okamura/P. D. Seymour: “Multicommodity Flows in Planar Graphs”, Journal of Combinatorial Theory 31, Series B, 1981, 75–81
F. Preparata/W. Lipski, Jr: “Three Layers are Enough”, 23rd FOCS 1982, 350–357
R. L. Rivest: “The “PI” (Placement and Interconnect) System”, 19th Design Automation Conference, 475–481, 1982
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaufmann, M., Mehlhorn, K. (1987). On local routing of two-terminal nets. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039593
Download citation
DOI: https://doi.org/10.1007/BFb0039593
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17219-2
Online ISBN: 978-3-540-47419-7
eBook Packages: Springer Book Archive