Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimal wiring between rectangles
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
DAC '76 Proceedings of the 13th Design Automation Conference
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
The minimum width routing of A 2-row 2-layer polycell-layout
DAC '79 Proceedings of the 16th Design Automation Conference
ALGORITHMS FOR INTEGRATED CIRCUIT LAYOUT: AN ANALYTIC APPROACH
ALGORITHMS FOR INTEGRATED CIRCUIT LAYOUT: AN ANALYTIC APPROACH
VLSI Architectures for multidimensional fourier transform processing
IEEE Transactions on Computers
A tight layout of the butterfly network
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Compact grid layouts of multi-level networks
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Some compact layouts of the butterfly
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Optimal Joining of Compacted Cells
IEEE Transactions on Computers
An approximation algorithm for manhattan routing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A fast algorithm to test planar topological routability
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
A provably good algorithm for high performance bus routing
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
| Hi-index | 0.01 |
Many problems that arise in general channel routing manifest themselves in simpler situations. We consider connecting a set of n terminals on a line to another set on a parallel line across a rectangular channel. We show that in any solution to the problem that (almost) minimizes the width of the channel (i.e. the distance between the lines the terminals reside on) a net may require as many as ?(?n) horizontal jogs no net routed from top to bottom need ever turn upward in the middle We also present an efficient algorithm to obtain minimal jogging in river routing, and provide necessary and sufficient conditions for conflict cycle resolution. These and other results are presented in the context of a general survey on routing from a combinatorial complexity point of view.