跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.09374 · v1

Pairwise Reconnection for Cost-Distance Steiner Trees

首次提交 2026-11-06 20:14
版本更新 2026-11-06 20:14
雷达观测 2026-11-09 11:19
arXiv ↗PDF ↗

摘要

The Uniform Cost-Distance Steiner Tree Problem asks for a rooted tree that minimizes the connection cost plus a weighted sum of root-to-terminal distances. We develop an algorithm that constructs two candidate trees: one based on direct connections to the root and another that pairs selected vertices and connects each pair to the root. The algorithm selects the tree with the smaller objective value. The resulting randomized algorithm achieves expected approximation factors of 1.6981.698 in the spanning case and 2.0412.041 in the general case, and it can be derandomized in polynomial time. The pairwise matching analysis charges part of the augmentation cost directly to the connection and delay costs of an optimal solution, rather than only to the separated lower bound used in previous analyses. This allows the 1.6981.698 factor to fall below the maximum multiplicative gap of 1+1/21+1/\sqrt{2} between the optimum value and that lower bound. We give instance families with approximation-ratio lower bounds approaching 1+1/21+1/\sqrt{2} for cut-and-reconnect algorithms that start from a minimum spanning tree and 3/23/2 for the present algorithm. Finally, we show that the Uniform Cost-Distance Steiner Tree Problem and the Steiner-tree version of the Cable-Trench Problem are approximation equivalent up to an arbitrarily small additive loss.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-06 20:14 · 最新观测版本

Pairwise Reconnection for Cost-Distance Steiner Trees

The Uniform Cost-Distance Steiner Tree Problem asks for a rooted tree that minimizes the connection cost plus a weighted sum of root-to-terminal distances. We develop an algorithm that constructs two candidate trees: one based on direct connections to the root and another that pairs selected vertices and connects each pair to the root. The algorithm selects the tree with the smaller objective value. The resulting randomized algorithm achieves expected approximation factors of 1.6981.698 in the spanning case and 2.0412.041 in the general case, and it can be derandomized in polynomial time. The pairwise matching analysis charges part of the augmentation cost directly to the connection and delay costs of an optimal solution, rather than only to the separated lower bound used in previous analyses. This allows the 1.6981.698 factor to fall below the maximum multiplicative gap of 1+1/21+1/\sqrt{2} between the optimum value and that lower bound. We give instance families with approximation-ratio lower bounds approaching 1+1/21+1/\sqrt{2} for cut-and-reconnect algorithms that start from a minimum spanning tree and 3/23/2 for the present algorithm. Finally, we show that the Uniform Cost-Distance Steiner Tree Problem and the Steiner-tree version of the Cable-Trench Problem are approximation equivalent up to an arbitrarily small additive loss.

查看此版本解读 →查看此版本原文 ↗