A bottom-up layout technique based on two-rectangle routing☆
References (11)
A provably good algorithm for the two module routing problem
SIAM J. Comput.
(1986)- Chandrasekhar, M.S. and M.A. Breuer, Optimum placement of two rectangular blocks, Technical Report, Department of...
- Chen, N.P., C.P. Hsu and E.S. Kuh, The Berkeley building block layout system, Technical Report, Electronics Research...
- et al.
An optimal algorithm for optimal routing around a rectangle
- et al.
Wire routing by channel assignment within large apertures
There are more references available in the full text version of this article.
Cited by (11)
On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
2003, Information Processing LettersImproved approximation algorithms for embedding hyperedges in a cycle
1998, Information Processing LettersAn efficient one-side height minimization algorithm for routing around a rectangle
1992, Information Processing LettersRouting in and around a rectangle using the overlap model
1991, Integration, the VLSI JournalTree placement in Cascode-Switch macros
1991, Integration, the VLSI JournalEfficient algorithms for minimum congestion hypergraph embedding in a cycle
2006, IEEE Transactions on Parallel and Distributed Systems
- ☆
This work was supported in part by the Semiconductor Research Corporation under contract RSCH 84-06-049-6.
Copyright © 1987 Published by Elsevier B.V.