The Community for Technology Leaders
Proceedings of the Second Great Lakes Symposium on VLSI (1992)
Kalamazoo, MI, USA
Feb. 28, 1992 to Feb. 29, 1992
ISBN: 0-8186-2610-0
pp: 144-151
J. Hamkins , Beckman Inst., Illinois Univ., Urbana, IL, USA
D.J. Brown , Beckman Inst., Illinois Univ., Urbana, IL, USA
ABSTRACT
A layout for the k-ary overlap rectangle routing problem (k-RRP) is a set of paths connecting pairs of terminals on the boundary such that each edge hosts at most k distinct nets. The authors give necessary and sufficient conditions for the existence of such a layout, and present an algorithm that constructs a layout, if one exists, in time O(kN), where N is the number of gridpoints in the rectangle. Extensions to more general problems are also discussed.<>
INDEX TERMS
circuit layout CAD, VLSI
CITATION

J. Hamkins and D. Brown, "Routing in a rectangle with k-ary overlap," Proceedings of the Second Great Lakes Symposium on VLSI(GLSV), Kalamazoo, MI, USA, , pp. 144-151.
doi:10.1109/GLSV.1992.218352
90 ms
(Ver 3.3 (11022016))