Automated printed circuit routing with a stepping aperture
Communications of the ACM
A new interactive supply/demand router with rip-up capability for printed circuit boards
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
A high performance routing engine
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
An investigation of iterative routing algorithms
EURO-DAC '95/EURO-VHDL '95 Proceedings of the conference on European design automation
A new routing algorithm and its hardware implementation
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Aiming at a general routing strategy
DAC '81 Proceedings of the 18th Design Automation Conference
A topologically based non-minimum distance routing algorithm
DAC '78 Proceedings of the 15th Design Automation Conference
Methods for hierarchical automatic layout of custom LSI circuit masks
DAC '78 Proceedings of the 15th Design Automation Conference
A new philosophy for interconnection on multilayer boards
DAC '76 Proceedings of the 13th Design Automation Conference
Hardware support for automatic routing
DAC '82 Proceedings of the 19th Design Automation Conference
Automated rip-up and reroute techniques
DAC '82 Proceedings of the 19th Design Automation Conference
An iterative-improvement penalty-function-driven wire routing system
IBM Journal of Research and Development
| Hi-index | 0.00 |
Wires are routed allowing crossings in the initial layout. By spreading the wires and increasing the crossover penalties, fewer crossings occur on each iteration until a crossing free layout is achieved.