- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Approximating Weighted Tree Augmentation via Chvatal-Gomory...
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Approximating Weighted Tree Augmentation via Chvatal-Gomory Cuts Sanita, Laura
Description
The weighted tree augmentation problem (\WTAP) is a fundamental network design problem. We are given an undirected tree $G = (V,E)$ with $n = |V|$ nodes, an additional set of edges $L$ called \emph{links} and a cost vector $c \in \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\'aJ\'a, '81) and $\tfrac{3}{2}$ for \TAP due to (Kortsarz and Nutov, TALG '16). Adjashvili (SODA~'17) recently presented an $\approx 1.96418+\eps$-approximation algorithm for \WTAP\ for the case where all link costs are bounded by a constant. 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 $\tfrac{3}{2}+\eps$-approximation for \WTAP under the bounded cost assumption. We achieve this by introducing a strong \LP that combines \zhcgcuts 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 performance guarantee of $\tfrac{3}{2}+\eps$, which is asymptotically on par with the result by Kortsarz and Nutov. Our result also is the best-known \LP-relative approximation algorithm for \TAP.
Item Metadata
| Title |
Approximating Weighted Tree Augmentation via Chvatal-Gomory Cuts
|
| Creator | |
| Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
| Date Issued |
2017-11-14T16:32
|
| Description |
The weighted tree augmentation problem (\WTAP) is a fundamental network design problem. We are given an undirected tree $G = (V,E)$ with $n = |V|$ nodes, an additional set of edges $L$ called \emph{links} and a cost vector $c \in \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\'aJ\'a,
'81) and $\tfrac{3}{2}$ for \TAP due to (Kortsarz and Nutov, TALG
'16). Adjashvili (SODA~'17) recently presented an
$\approx 1.96418+\eps$-approximation algorithm for \WTAP\ for the case
where all link costs are bounded by a constant. 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 $\tfrac{3}{2}+\eps$-approximation for \WTAP under the bounded cost assumption. We achieve this by introducing a strong \LP that combines \zhcgcuts 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 performance guarantee of $\tfrac{3}{2}+\eps$, which is asymptotically on par with the result by Kortsarz and Nutov. Our result also is the best-known \LP-relative approximation algorithm for \TAP.
|
| Extent |
29 minutes
|
| Subject | |
| Type | |
| File Format |
video/mp4
|
| Language |
eng
|
| Notes |
Author affiliation: University of Waterloo
|
| Series | |
| Date Available |
2018-05-14
|
| Provider |
Vancouver : University of British Columbia Library
|
| Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
| DOI |
10.14288/1.0366272
|
| URI | |
| Affiliation | |
| Peer Review Status |
Unreviewed
|
| Scholarly Level |
Researcher
|
| Rights URI | |
| Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International