Routing through a generalized switchbox
Journal of Algorithms
Optimal Three-Layer Channel Routing
IEEE Transactions on Computers
An approximation algorithm for manhattan routing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
This paper presents a new algorithm for channel routing of multiterminal nets. We first transform any multiterminal problem of density d to a socalled extended simple channel routing problem (ESCRP ) of density 3d/2+O(√dlog d), which will then be solved with channel width w ≤3d/2+O(√dlog d) in the knock-knee model. The same strategy can be used for routing in the other two models: The channel width is w ≤ 3d/2+O(√dlog d)+O(f) in the Manhattan model, where f is the flux of the problem, and w ≤ 3d/2+O(√dlogd) in the unit-vertical-overlap model. In all three cases we improve the best known upper bounds.