This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Single Row Routing
March 1983 (vol. 32 no. 3)
pp. 209-220
R. Raghavan, Sperry Univac
The automated design of multilayer printed circuit boards is of great importance in the physical design of complex electronic systems. Wire routing is a crucial step in the design process. In this paper, the single row routing problem is considered. First, we discuss the relevance of single row routing in the context of the general routing problem. Then, we show that relaxing the restriction that backward moves are not allowed can result in smaller street congestions when there are at least four tracks in each street. Next, we obtain an O((2k)!kn log k) algorithm to determine whether or not an instance involving n nodes can be laid out (without backward moves) when only k tracks per street are available. With the additional restriction that wires are not permitted to cross streets, an efficient (O(n2)) algorithm is obtained. This restricted problem is shown to be related to a furnace assignment problem.
Index Terms:
single row routing, Algorithm, complexity
Citation:
R. Raghavan, S. Sahni, "Single Row Routing," IEEE Transactions on Computers, vol. 32, no. 3, pp. 209-220, March 1983, doi:10.1109/TC.1983.1676213
Usage of this product signifies your acceptance of the Terms of Use.