DocumentCode
912672
Title
Single-Row Routing in Narrow Streets
Author
Han, Sanyong ; Sahni, Sartaj
Author_Institution
Department of Computer Science, University of Minnesota, Minneapolis, MN, USA
Volume
3
Issue
3
fYear
1984
fDate
7/1/1984 12:00:00 AM
Firstpage
235
Lastpage
241
Abstract
We develop fast linear time algorithms for single row routing when the upper and lower street capacities are less than or equal to three. A similarly fast algorithm is developed for the case when one of the streets has a capacity 1 and the other has an arbitrary capacity. Experimental results show that our algorithms are many times faster than previously developed algorithms.
Keywords
Computer science; Design automation; Law; Legal factors; Nonhomogeneous media; Pins; Printed circuits; Routing; Wire; Wiring;
fLanguage
English
Journal_Title
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0278-0070
Type
jour
DOI
10.1109/TCAD.1984.1270080
Filename
1270080
Link To Document