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

改进的Steiner树积分间隙

An Improved Integrality Gap for Steiner Tree

Ali Çivril, Muhammed Mirza Biçer, Berkay Tahsin Tunca, Muhammet Yasin Kangal

AI总结:

本文提出了一种基于对偶-原算法的组合算法,将Steiner树问题的双向割松弛的积分间隙从2改进到1/2。

摘要:

获得改进的Steiner树近似算法的一种有希望的方法是使用双向割松弛(BCR)。这种松弛的积分间隙至少为36/31,长期以来人们一直猜测其真实值非常接近这个下限。然而,一般图的最好上界曾是一个几乎平凡的2。我们通过基于对偶-原算法的组合算法,将这个界改进到1/2。

英文摘要:

A promising approach for obtaining improved approximation algorithms for Steiner tree is to use the bidirected cut relaxation (BCR). The integrality gap of this relaxation is at least $36/31$, and it has long been conjectured that its true value is very close to this lower bound. However, the best upper bound for general graphs was an almost trivial $2$. We improve this bound to $3/2$ by a combinatorial algorithm based on the primal-dual schema.

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

↑