One-layer routing without component constraints
Journal of Computer and System Sciences
Generalized river routing - algorithms and performance bounds
Proc. of the Aegean workshop on computing on VLSI algorithms and architectures
Heuristic Algorithms for Single Row Routing
IEEE Transactions on Computers
An approximation algorithm for Manhattan routing
Advances in computing research, vol. 2
Minimizing External Wires in Generalized Single-Row Routing
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An optimal solution to a wire-routing problem (preliminary version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Cellular wiring and the cellular modeling technique
DAC '69 Proceedings of the 6th annual Design Automation Conference
CALMOS: A portable software system for the automatic and interactive layout of MOS/LSI
DAC '79 Proceedings of the 16th Design Automation Conference
The impact of wire topology on channel routing
The impact of wire topology on channel routing
IEEE Transactions on Computers
An Efficient Single-Row Routing Algorithm
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.89 |
Since numerous aspects of PCB and VLSI routing have been shown to be NP-complete, research has focussed on the effects of placing various restrictions on the routing problem. One common approach is to severely constrain the topological structure of the wires that interconnect common signal points. Unfortunately, it is generally the case that the size of a. routing is inversely proportional to the restrictiveness of these constraints. For instance, it has been shown for two-row routings that the use of less restrictive wire topologies (e.g. external wires) can allow significantly more compact routines. In contrast, we establish that for single row routing, the use of external wires provides only a trivial improvement (in compactness of the routing) over more constrained (and traditional) types of routings.