An algorithm for searching shortest path by propagating wave fronts in four quadrants
DAC '81 Proceedings of the 18th Design Automation Conference
Performance of interconnection rip-up and reroute strategies
DAC '81 Proceedings of the 18th Design Automation Conference
TWIGY - a topological algorithm based routing system
DAC '81 Proceedings of the 18th Design Automation Conference
DAC '78 Proceedings of the 15th Design Automation Conference
DAC '80 Proceedings of the 17th Design Automation Conference
A line-expansion algorithm for the general routing problem with a guaranteed solution
DAC '80 Proceedings of the 17th Design Automation Conference
An analytic technique for router comparison
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
A solution to line-routing problems on the continuous plane
DAC '69 Proceedings of the 6th annual Design Automation Conference
Some theoretical aspects of algorithmic routing
DAC '77 Proceedings of the 14th Design Automation Conference
An iterative technique for printed wire routing
DAC '74 Proceedings of the 11th Design Automation Workshop
DAC '79 Proceedings of the 16th Design Automation Conference
An interactive routing program with On-line clean-up of sketched routes
DAC '79 Proceedings of the 16th Design Automation Conference
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
Fast printed circuit board routing
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
A new hypergraph based rip-up and reroute strategy
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
An appreciation of simulated annealing to maze routing
EURO-DAC '94 Proceedings of the conference on European design automation
Routing in a Three-Dimensional Chip
IEEE Transactions on Computers
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
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A new look at hardware maze routing
Proceedings of the 12th ACM Great Lakes symposium on VLSI
A general heuristic for vehicle routing problems
Computers and Operations Research
Integer Linear Programming Models for Global Routing
INFORMS Journal on Computing
High-performance routing at the nanometer scale
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Genetic algorithm and large neighbourhood search to solve the cell formation problem
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
The ultimate goal of all automated routing systems is to interconnect 100% of the necessary point-to-point electrical connections. However, most automated routing systems fail to find acceptable paths for all required connections because of limited routing resources or problem complexity. Therefore, a cleanup phase is often necessary. During this cleanup phase, connectivity can be improved through a variety of manual and automated techniques. This paper concentrates on one automated technique, rip-up and reroute. Various rip-up and reroute strategies are discussed and evaluated, and experimental results are provided.