A new hypergraph based rip-up and reroute strategy

Authors:
Manuela Raith;Marc Bartholomeus
Affiliations:
Ludwig-Maximilians-University, Mathematisches Institut, Theresienstr. 39, D-8000 Munich 2, Germany;Siemens AG, ZFE IS EA 32, Otto-Hahn-Ring 6, D-8000 Munich 83, Germany
Venue:
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Year:
1991

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 new routing algorithm and its hardware implementation

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Hierarchical dynamic router

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Automated rip-up and reroute techniques

DAC '82 Proceedings of the 19th Design Automation Conference

An appreciation of simulated annealing to maze routing

EURO-DAC '94 Proceedings of the conference on European design automation
A sequential detailed router for huge grid graphs

Proceedings of the conference on Design, automation and test in Europe

Hi-index	0.01