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

通过提升和投影的近似(未加权)树扩充,部分II

Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II

Joe Cheriyan, Zhihan Gao

摘要:

在第二部分中,我们研究了基于Lasserre(Sum~of~Squares)系统的无权树扩充问题(TAP)。我们证明了一个SDP松弛(LP松弛的Lasserre收紧)的完整性比是$\leq \frac{3}{2}+ε$,其中$ε>0$可以是任何小常数。我们通过设计一个多项式时间的TAP算法,实现了($\frac32+ε$)相对于SDP松弛的近似保证,从而获得这一结果。该算法是组合的,不解决SDP松弛,但我们的分析依赖于SDP松弛。我们通过Karlin,Mathieu和Nguyen(IPCO 2011)的分解结果确定了Lasserre系统的分数阶解的一些性质,从而将以往文献中积分解的组合分析推广到分数阶解.

英文摘要:

In Part II, we study the unweighted Tree Augmentation Problem (TAP) via the Lasserre (Sum~of~Squares) system. We prove that the integrality ratio of an SDP relaxation (the Lasserre tightening of an LP relaxation) is $\leq \frac{3}{2}+ε$, where $ε>0$ can be any small constant. We obtain this result by designing a polynomial-time algorithm for TAP that achieves an approximation guarantee of ($\frac32+ε$) relative to the SDP relaxation. The algorithm is combinatorial and does not solve the SDP relaxation, but our analysis relies on the SDP relaxation. We generalize the combinatorial analysis of integral solutions from the previous literature to fractional solutions by identifying some properties of fractional solutions of the Lasserre system via the decomposition result of Karlin, Mathieu and Nguyen (IPCO 2011).

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

↑