Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing

Markus Ahrens, Dorothee Henke, Stefan Rabenstein +1

We develop new algorithmic techniques for VLSI detailed routing. First, we improve the goal-oriented version of Dijkstra's algorithm to find shortest paths in huge incomplete grid…