Routing through a generalized switchbox
Journal of Algorithms
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Simple three-layer channel routing algorithms
VLSI Algorithms and Architectures
An approximation algorithm for Manhattan routing
Advances in computing research, vol. 2
Optimal Three-Layer Channel Routing
IEEE Transactions on Computers
An optimum channel routing algorithm in the restricted wire overlap model
Integration, the VLSI Journal
Nearly optimal algorithms and bounds for multilayer channel routing
Journal of the ACM (JACM)
DAC '76 Proceedings of the 13th Design Automation Conference
DAC '82 Proceedings of the 19th Design Automation Conference
The “PI” (placement and interconnect) system
DAC '82 Proceedings of the 19th Design Automation Conference
Nearly optimal algorithms and bounds for multilayer channel routing
Journal of the ACM (JACM)
3-Dimensional Single Active Layer Routing
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Routing vertex disjoint steiner-trees in a cubic grid and connections to VLSI
Discrete Applied Mathematics
| Hi-index | 0.00 |
This paper presents new upper bounds for channel routing of multiterminal nets, which answers the long-standing open question whether or not multiterminal problems really require channels two times wider than 2-terminal problems. We transform any multiterminal problem of density d into a so-called extended simple channel routing problem (ESCRP) of density 3d/2+Odlog d . We then descibe routing algorithms for solving ESCRPs in three different models. The channel width w is ≤3d/2+Odlog d in the knock-knee and unit-vertical-overlap models, and w≤3d/2+O dlogd +Of in the Manhattan model, where f is the flux of the problem. In all three cases, we improve the best-known upper bounds.