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

基于Chvátal-Gomory割的树扩充的$\frac{3}{2}$ -近似算法

A $\frac{3}{2}$-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts

Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità

摘要:

加权树扩充问题(WTAP)是一个基本的网络设计问题。我们给出了一个无向树$G = (V,E)$,一个额外的一组边$L$称为链接和成本向量$c \in \mathbb{R}^L_{\geq 1}$。目标是选择最小成本子集$S \subseteq L$,使得$G = (V, E \cup S)$是$2$ -边缘连接的。在未加权的情况下,也就是说,当我们有$c_\ell = 1$为所有$\ell \in L$,问题被称为树扩增问题(TAP)。已知这两个问题都是APX困难的,最著名的近似因子是WTAP的$2$(Frederickson和JáJá,'81)和TAP的$\tfrac{3}{2}$(Kortsarz和Nutov,TALG '16)。在所有链路成本由恒定$M$限定的情况下,(Adjiashvili,SODA '17)最近给出了在此假设下WTAP的$\approx 1.96418+\varepsilon$近似算法。这是第一个比$2$有更好保证的近似,它不需要对树或链接的结构进行限制。在本文中,我们改进Adjiashvili的近似的$\frac{3}{2}+\varepsilon$ -近似的有界成本假设下的WTAP。我们实现这一点,通过引入一个强大的LP,结合$\{0,\frac{1}{2}\}$ -Chvátal-Gomory削减标准LP的问题,捆绑约束Adjiashvili。我们表明,我们的LP可以有效地解决,它是确切的某些情况下出现的核心Adjiashvili的方法。这导致$\frac{3}{2}+\varepsilon$的改进保证。对于TAP,这是已知的最好的基于LP的结果,并且匹配由于(Cheriyan和Gao,arXiv '15)而通过最好的基于SDP的算法实现的$\frac{3}{2}+\varepsilon$的界限。

英文摘要:

The weighted tree augmentation problem (WTAP) is a fundamental network design problem. We are given an undirected tree $G = (V,E)$, an additional set of edges $L$ called links and a cost vector $c \in \mathbb{R}^L_{\geq 1}$. The goal is to choose a minimum cost subset $S \subseteq L$ such that $G = (V, E \cup S)$ is $2$-edge-connected. In the unweighted case, that is, when we have $c_\ell = 1$ for all $\ell \in L$, the problem is called the tree augmentation problem (TAP). Both problems are known to be APX-hard, and the best known approximation factors are $2$ for WTAP by (Frederickson and JáJá, '81) and $\tfrac{3}{2}$ for TAP due to (Kortsarz and Nutov, TALG '16). In the case where all link costs are bounded by a constant $M$, (Adjiashvili, SODA '17) recently gave a $\approx 1.96418+\varepsilon$-approximation algorithm for WTAP under this assumption. This is the first approximation with a better guarantee than $2$ that does not require restrictions on the structure of the tree or the links. In this paper, we improve Adjiashvili's approximation to a $\frac{3}{2}+\varepsilon$-approximation for WTAP under the bounded cost assumption. We achieve this by introducing a strong LP that combines $\{0,\frac{1}{2}\}$-Chvátal-Gomory cuts for the standard LP for the problem with bundle constraints from Adjiashvili. We show that our LP can be solved efficiently and that it is exact for some instances that arise at the core of Adjiashvili's approach. This results in the improved guarantee of $\frac{3}{2}+\varepsilon$. For TAP, this is the best known LP-based result, and matches the bound of $\frac{3}{2}+\varepsilon$ achieved by the best SDP-based algorithm due to (Cheriyan and Gao, arXiv '15).

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

↑