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 graphs with edge costs depending on the direction and the layer, and possibly on rectangular regions. We devise estimates of the distance to the targets that offer better trade-offs between running time and quality than previously known methods, leading to an overall speed-up. Second, we combine the advantages of the two classical detailed routing approaches - global shortest path search and track assignment with local corrections - by treating input wires (such as the output of track assignment) as reservations that can be used at a discount by the respective net. We show how to implement this new approach efficiently.

翻译：我们为VLSI详细路由开发新的算法技术。 首先,我们改进了Dijkstra的面向目标的算法,在巨大的不完整网格图中找到最短路径,边际成本取决于方向和层次,并可能取决于长方形区域。我们设计了与目标距离的估计,这些距离在运行时间和质量之间提供了比以往已知方法更好的权衡,从而导致总体加速。第二,我们结合了两种传统的详细路线选择方法的优势――全球最短路径搜索和跟踪任务与地方校正――通过将输入电线(如轨道任务的产出)作为相关网络可以折扣使用的定额。我们展示了如何高效地实施这一新方法。