4 citations · 4 across the 1 of their papers we have counts for
1 paper
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…