An approximation algorithm for Manhattan routing
Advances in computing research, vol. 2
Optimal Three-Layer Channel Routing
IEEE Transactions on Computers
A 2d - 1 Lower Bound for Two-Layer Knock-Knee Channel Routing
SIAM Journal on Discrete Mathematics
Channel routing of multiterminal nets
Journal of the ACM (JACM)
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
DAC '82 Proceedings of the 19th Design Automation Conference
The “PI” (placement and interconnect) system
DAC '82 Proceedings of the 19th Design Automation Conference
New algorithms and bounds for multilayer channel routing
New algorithms and bounds for multilayer channel routing
Disjoint paths through a 3-dimensional grid
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Channel routing of multiterminal nets
Journal of the ACM (JACM)
Manhattan-diagonal routing in channels and switchboxes
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Hi-index | 0.00 |
This paper presents algorithms for routing channels with L≥2 layers. For the unit vertical overlap model, we describe a two-layer channel routing algorithm that uses at most d+Od tracks to route two-terminal net problems and 2d+od tracks to route multiterminal nets. We also show that d+Wlog d tracks are required to route two-terminal net problems in the worst case even if arbitrary vertical overlap is allowed. We generalize the algorithm to unrestricted multilayer routing and use only d/L-1+O d/L+1 tracks for two-terminal net problems (within within Od/L+ 1tracks of optimaland d/L-2+O d/L+1 tracks for multiterminal net problems within a factor ofL-1 /L-2times optimal . We demonstrate the generality of our routing strategy by showing that it can be used to duplicate some of the best previous upper bounds for other models (two-layer Manhattan routing and two and three-layer knock-knee routing of two-terminal, two-sided nets), and gives a new upper bound for rotuing with 45-degree diagonal wires.