arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1607.03791cs.DS
收藏

一种改进的有界代价加权树扩充算法

Improved Approximation for Weighted Tree Augmentation with Bounded Costs

David Adjiashvili

摘要:

加权树扩充问题(WTAP)是网络设计领域中一个基本的研究问题。给定一个无向树$G=(V,E)$,一个与$E$不相交的边集$L \subseteq V\times V$,称为\textit{links},以及一个代价向量$c\in \mathbb{R}_{\geq 0}^L$,WTAP要求找到一个最小代价集$F\subseteq L$,其性质是$(V,E\cup F)$是$2$ -边连通的。对于所有$\ell\in L$的$c_\ell = 1$的特殊情况称为树扩充问题(TAP)。这两个问题都是NP难的。对于一类有界代价向量,我们提出了三十多年来第一个改进的近似算法WTAP。具体地说,对于任何$M\in \mathbb{Z}_{\geq 1}$和$ε> 0,$,我们提出了一个基于LP的$(δ+ε)$ -近似的WTAP限制到成本向量$c$在$[1,M]^L$为$δ\approx 1.96417$。对于TAP的特殊情况,我们将该因子改进为$\frac{5}{3}+ε$。我们的研究结果依赖于一个新的LP,显着不同于现有的LP实现改进的TAP边界。我们将分数阶解分两个阶段舍入。第一阶段使用分数解将树及其分数解分解为所谓的$β$ -简单对,在目标函数中仅丢失一个$ε$ -因子。然后,我们将展示如何使用我们的LP中的附加约束与$β$ -简单结构相结合,在分解的每个部分中舍入分数解。

英文摘要:

The Weighted Tree Augmentation Problem (WTAP) is a fundamental well-studied problem in the field of network design. Given an undirected tree $G=(V,E)$, an additional set of edges $L \subseteq V\times V$ disjoint from $E$ called \textit{links}, and a cost vector $c\in \mathbb{R}_{\geq 0}^L$, WTAP asks to find a minimum-cost set $F\subseteq L$ with the property that $(V,E\cup F)$ is $2$-edge connected. The special case where $c_\ell = 1$ for all $\ell\in L$ is called the Tree Augmentation Problem (TAP). Both problems are known to be NP-hard. For the class of bounded cost vectors, we present a first improved approximation algorithm for WTAP since more than three decades. Concretely, for any $M\in \mathbb{Z}_{\geq 1}$ and $ε> 0,$ we present an LP based $(δ+ε)$-approximation for WTAP restricted to cost vectors $c$ in $[1,M]^L$ for $δ\approx 1.96417$. For the special case of TAP we improve this factor to $\frac{5}{3}+ε$. Our results rely on a new LP, that significantly differs from existing LPs achieving improved bounds for TAP. We round a fractional solution in two phases. The first phase uses the fractional solution to decompose the tree and its fractional solution into so-called $β$-simple pairs losing only an $ε$-factor in the objective function. We then show how to use the additional constraints in our LP combined with the $β$-simple structure to round a fractional solution in each part of the decomposition.

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

↑