论文标题
预算的施泰纳网络：三个端子相等的路径重量
Budgeted Steiner Networks: Three Terminals with Equal Path Weights
论文作者
论文摘要
给定一组终端中的2D/3D终端，连接所有终端的总长度最短的网络是施泰纳树。另一方面，有足够的预算，每个终端都可以通过直边连接到其他所有终端，从而在所有端子上产生完整的图形。在这项工作中，我们研究了斯坦纳树的概括，询问这两个极端之间会发生什么。专注于具有相等成对路径权重的三个终端，我们表征了施泰纳树和完整图之间的完整进化途径，其中包含有趣的中间结构。
Given a set of terminals in 2D/3D, the network with the shortest total length that connects all terminals is a Steiner tree. On the other hand, with enough budget, every terminal can be connected to every other terminals via a straight edge, yielding a complete graph over all terminals. In this work, we study a generalization of Steiner trees asking what happens in between these two extremes. Focusing on three terminals with equal pairwise path weights, we characterize the full evolutionary pathway between the Steiner tree and the complete graph, which contains intriguing intermediate structures.
