均匀成本-距离Steiner树问题的更紧近似
Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
AI总结：
针对均匀成本-距离Steiner树问题，该研究通过优化子树拆分策略并改进分析，将近似因子从2.39提升至2.05，且在最小长度Steiner树可任意近似时达到接近1+1/√2的紧界。
摘要：
均匀成本-距离Steiner树最小化总长度与从专用根节点到其他终端的加权路径长度之和。这类树适用于信号传输场景，例如芯片设计或电信网络。它们是一般成本-距离Steiner树的特例，后者对总长度和路径长度使用不同的距离函数。\n 我们将均匀成本-距离Steiner树问题已发表的最佳近似因子从2.39提升至2.05。若我们能任意好地近似最小长度Steiner树问题，我们的算法可达到任意接近$1 + \frac{1}{\sqrt{2}}$的近似因子。该界在以下意义上是紧的：我们还证明了最优解与我们及该问题所有先前近似算法所使用的下界之间存在$1 + \frac{1}{\sqrt{2}}$的间隙。\n 与先前方法类似，我们从一棵近似的最小长度Steiner树出发，将其拆分为若干子树，随后重新连接这些子树。为提升近似因子，我们更精细地拆分组件，同时考虑成本结构，并显著改进了分析过程。
英文摘要：
Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is intended for signal transmission, e.g. in chip design or telecommunication networks. They are a special case of general cost-distance Steiner trees, where different distance functions are used for total length and path lengths. We improve the best published approximation factor for the uniform cost-distance Steiner tree problem from 2.39 to 2.05. If we can approximate the minimum-length Steiner tree problem arbitrarily well, our algorithm achieves an approximation factor arbitrarily close to $ 1 + \frac{1}{\sqrt{2}} $. This bound is tight in the following sense. We also prove the gap $ 1 + \frac{1}{\sqrt{2}} $ between optimum solutions and the lower bound which we and all previous approximation algorithms for this problem use. Similarly to previous approaches, we start with an approximate minimum-length Steiner tree and split it into subtrees that are later re-connected. To improve the approximation factor, we split it into components more carefully, taking the cost structure into account, and we significantly enhance the analysis.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
