The rectilinear Steiner minimum tree (RSMT) problem computes the shortest network connecting a given set of points using only horizontal and vertical lines, possibly adding extra points (Steiner points) to minimize the total length. RSMT solvers seek to balance speed and accuracy. In this work, we design a framework to boost existing RSMT solvers, extending the Pareto front. Combined with GeoSteiner, our algorithm reaches 5.16\% length error on nets with 1000 pins. The average time needed is 0.46 seconds. This provides an effective way to solve large-scale RSMT problems with small-scale solvers.

翻译：直角斯坦纳最小树（RSMT）问题旨在通过仅使用水平与垂直线段（可能引入额外的斯坦纳点）构建连接给定点集的最短网络，以最小化总长度。RSMT求解器需要在求解速度与精度之间取得平衡。本研究设计了一个提升现有RSMT求解器的框架，从而扩展了帕累托前沿。结合GeoSteiner算法，本方法在包含1000个端点的线网上实现了5.16%的长度误差，平均耗时仅0.46秒。这为利用小规模求解器解决大规模RSMT问题提供了有效途径。