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

强Steiner树近似在实践中的应用

Strong Steiner Tree Approximations in Practice

Stephan Beyer, Markus Chimani

摘要:

在这个实验研究中,我们考虑Steiner树近似,保证比小于$2$的常数近似。所考虑的基于线性规划的贪心算法和方法涉及对某些$k \geq 3$的$k$限制的全分量的合并。对于大多数的算法,其最强的理论近似界只达到$k \to \infty$。然而,运行时间也与$k$成指数关系,因此实际上只有小的$k$是可处理的。我们调查不同的实施方面和参数的选择,最终使我们能够构建算法(有点)可行的实际使用。我们相互比较的算法,一个精确的LP为基础的算法,快速和简单的$2$近似。

英文摘要:

In this experimental study we consider Steiner tree approximations that guarantee a constant approximation of ratio smaller than $2$. The considered greedy algorithms and approaches based on linear programming involve the incorporation of $k$-restricted full components for some $k \geq 3$. For most of the algorithms, their strongest theoretical approximation bounds are only achieved for $k \to \infty$. However, the running time is also exponentially dependent on $k$, so only small $k$ are tractable in practice. We investigate different implementation aspects and parameter choices that finally allow us to construct algorithms (somewhat) feasible for practical use. We compare the algorithms against each other, to an exact LP-based algorithm, and to fast and simple $2$-approximations.

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

↑