arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.03583cs.DS
收藏

基于星收缩的Steiner树近似算法:一种统一视角

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View

Charles University(查理大学);Czech Technical University in Prague(捷克布拉格理工大学);University of Warsaw(华沙大学)

Radek Hušek, Dušan Knop, Tomáš Masařík

AI总结:

本文提出了一种基于星收缩的Steiner树近似算法,通过实证研究改进了现有算法,提高了解的质量并保持了高效的运行时间。

摘要:

在Steiner树问题中,我们给定一个边带权的无向图G=(V,E)和一个终端集合R⊆V。任务是找到一个包含R的连通子图,并使其边权和最小。我们观察到许多Steiner树的近似算法遵循类似的方案(元算法),并执行类似的程序,我们称之为星收缩。在这里,通过星收缩,我们指的是在输入图中寻找一个星状子图,使其权重与所包含终端数减一的比率最小。不难看出,著名的MST近似算法寻找包含仅两个终端的最优星形进行收缩。我们对星收缩进行了实证研究,放松了每个星收缩中终端数量的条件。我们的实验表明:--如果算法执行星收缩,所得解的质量通常略优于Zelikovsky的11/6近似算法;--平均而言,MST近似算法返回的解质量随着每次星收缩而提高;--同样的情况适用于迭代MST(MST+),它在每项测量中都优于MST,同时保持非常快的运行时间(平均约为MST的3倍慢);--平均而言,通过彻底执行星收缩得到的解质量比初始MST近似算法大约好16%;--我们提出了一种更精确的方法来寻找所谓的改进星,这在可比较的运行时间内产生稍好的解(平均约为3倍慢)。此外,我们提出了Zelikovsky的11/6近似算法的两种改进,并实证确认了任何这些算法返回的解质量都优于前者算法返回的解质量。

英文摘要:

In the Steiner Tree problem we are given an edge weighted undirected graph $G = (V,E)$ and a set of terminals $R \subseteq V$. The task is to find a connected subgraph of $G$ containing $R$ and minimizing the sum of weights of its edges. We observe that many approximation algorithms for Steiner Tree follow a similar scheme (meta-algorithm) and perform (exhaustively) a similar routine which we call star contraction. Here, by a star contraction, we mean finding a star-like subgraph in the input graph minimizing the ratio of its weight to the number of contained terminals minus one. It is not hard to see that the well-known MST-approximation seeks the best star to contract among those containing two terminals only. We perform an empirical study of star contractions with the relaxed condition on the number of terminals in each star contraction. Our experiments suggest the following: -- if the algorithm performs star contractions exhaustively, the quality of the solution is usually slightly better than Zelikovsky's 11/6-approximation algorithm, -- on average the quality of the solution returned by the MST-approximation algorithm improves with every star contraction, -- the same holds for iterated MST (MST+), which outperforms MST in every measurement while keeping very fast running time (on average $\sim 3\times$ slower than MST), -- on average the quality of the solution obtained by exhaustively performing star contraction is about 16\% better than the initial MST-approximation, and -- we propose a more precise way to find the so-called improved stars which yield a slightly better solution within a comparable running time (on average $\sim 3\times$ slower). Furthermore, we propose two improvements of Zelikovsky's 11/6-approximation algorithm and we empirically confirm that the quality of the solution returned by any of these is better than the one returned by the former algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑