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算法的目标导向版本，以在具有依赖于方向和层、可能还依赖于矩形区域的边代价的大型不完整网格图中寻找最短路径。我们设计了到目标距离的估计方法，相比已知方法在运行时间与质量之间提供了更好的权衡，从而实现了整体加速。其次，我们将两种经典详细布线方法——全局最短路径搜索与基于局部修正的轨道分配——的优势相结合，通过将输入线网（如轨道分配的输出）视为保留路径，使得相应线网能够以折扣代价使用这些路径。我们展示了如何高效实现这一新方法。