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

求解拟二部图超图Steiner树松弛的有效算法

Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances

Isaac Fung, Konstantinos Georgiou, Jochen Koenemann, Malcolm Sharpe

摘要:

我们考虑准二部图中的Steiner树问题,其中没有两个Steiner顶点由边连接。对于这类实例,我们提出了一种有效的算法来精确求解所谓的有向分量松弛(DCR),这是一种特殊形式的超图LP松弛,有助于Byrka等人[BGRS 10](STOC 2010)最近的突破性结果。我们的算法取决于一个有效的可计算的映射从极端点的双向切割松弛可行的解决方案(DCR)。因此,与[BGRS 10]一起,我们立即获得了准二分Steiner树实例的有效73/60近似。我们还提出了一个特别简单的(BCR)为基础的随机采样算法,实现了性能保证略优于77/60。

英文摘要:

We consider the Steiner tree problem in quasi-bipartite graphs, where no two Steiner vertices are connected by an edge. For this class of instances, we present an efficient algorithm to exactly solve the so called directed component relaxation (DCR), a specific form of hypergraphic LP relaxation that was instrumental in the recent break-through result by Byrka et al. [BGRS10] (STOC 2010). Our algorithm hinges on an efficiently computable map from extreme points of the bidirected cut relaxation to feasible solutions of (DCR). As a consequence, together with [BGRS10] we immediately obtain an efficient 73/60-approximation for quasi-bipartite Steiner tree instances. We also present a particularly simple (BCR)-based random sampling algorithm that achieves a performance guarantee slightly better than 77/60.

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

↑