Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
A solution to line-routing problems on the continuous plane
DAC '69 Proceedings of the 6th annual Design Automation Conference
Cellular wiring and the cellular modeling technique
DAC '69 Proceedings of the 6th annual Design Automation Conference
A “lookahead” router for multilayer printed wiring boards
DAC '79 Proceedings of the 16th Design Automation Conference
Heuristic Algorithms for Single Row Routing
IEEE Transactions on Computers
Visualization of Parallel Execution Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
On the pagenumber of planar graphs
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Approximating the fixed linear crossing number
Discrete Applied Mathematics
The benefits of external wires in single row routing
Information Processing Letters
Two pages graph layout via recurrent multivalued neural networks
IWANN'07 Proceedings of the 9th international work conference on Artificial neural networks
K-pages graph drawing with multivalued neural networks
ICANN'07 Proceedings of the 17th international conference on Artificial neural networks
On old and new routing problems
Proceedings of the 2011 international symposium on Physical design
| Hi-index | 14.98 |
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.