FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4288027246> ?p ?o ?g. }

• W4288027246 abstract "The basic goal of survivable network design is to build a cheap network that maintains the connectivity between given sets of nodes despite the failure of a few edges/nodes. The Connectivity Augmentation Problem (CAP) is arguably one of the most basic problems in this area: given a $k$(-edge)-connected graph $G$ and a set of extra edges (links), select a minimum cardinality subset $A$ of links such that adding $A$ to $G$ increases its edge connectivity to $k+1$. Intuitively, one wants to make an existing network more reliable by augmenting it with extra edges. The best known approximation factor for this NP-hard problem is $2$, and this can be achieved with multiple approaches (the first such result is in [Frederickson and J'aj'a'81]). It is known [Dinitz et al.'76] that CAP can be reduced to the case $k=1$, a.k.a. the Tree Augmentation Problem (TAP), for odd $k$, and to the case $k=2$, a.k.a. the Cactus Augmentation Problem (CacAP), for even $k$. Several better than $2$ approximation algorithms are known for TAP, culminating with a recent $1.458$ approximation [Grandoni et al.'18]. However, for CacAP the best known approximation is $2$. In this paper we breach the $2$ approximation barrier for CacAP, hence for CAP, by presenting a polynomial-time $2ln(4)-frac{967}{1120}+epsilon<1.91$ approximation. Previous approaches exploit properties of TAP that do not seem to generalize to CacAP. We instead use a reduction to the Steiner tree problem which was previously used in parameterized algorithms [Basavaraju et al.'14]. This reduction is not approximation preserving, and using the current best approximation factor for Steiner tree [Byrka et al.'13] as a black-box would not be good enough to improve on $2$. To achieve the latter goal, we ``open the box'' and exploit the specific properties of the instances of Steiner tree arising from CacAP." @default.
• W4288027246 created "2022-07-26" @default.
• W4288027246 creator A5023591555 @default.
• W4288027246 creator A5034276567 @default.
• W4288027246 creator A5063520973 @default.
• W4288027246 date "2019-11-06" @default.
• W4288027246 modified "2023-09-24" @default.
• W4288027246 title "Breaching the 2-Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree" @default.
• W4288027246 doi "https://doi.org/10.48550/arxiv.1911.02259" @default.
• W4288027246 hasPublicationYear "2019" @default.
• W4288027246 type Work @default.
• W4288027246 citedByCount "0" @default.
• W4288027246 crossrefType "posted-content" @default.
• W4288027246 hasAuthorship W4288027246A5023591555 @default.
• W4288027246 hasAuthorship W4288027246A5034276567 @default.
• W4288027246 hasAuthorship W4288027246A5063520973 @default.
• W4288027246 hasBestOaLocation W42880272461 @default.
• W4288027246 hasConcept C111335779 @default.
• W4288027246 hasConcept C113174947 @default.
• W4288027246 hasConcept C114614502 @default.
• W4288027246 hasConcept C118615104 @default.
• W4288027246 hasConcept C124101348 @default.
• W4288027246 hasConcept C148764684 @default.
• W4288027246 hasConcept C2524010 @default.
• W4288027246 hasConcept C311688 @default.
• W4288027246 hasConcept C33923547 @default.
• W4288027246 hasConcept C41008148 @default.
• W4288027246 hasConcept C76220878 @default.
• W4288027246 hasConcept C87117476 @default.
• W4288027246 hasConceptScore W4288027246C111335779 @default.
• W4288027246 hasConceptScore W4288027246C113174947 @default.
• W4288027246 hasConceptScore W4288027246C114614502 @default.
• W4288027246 hasConceptScore W4288027246C118615104 @default.
• W4288027246 hasConceptScore W4288027246C124101348 @default.
• W4288027246 hasConceptScore W4288027246C148764684 @default.
• W4288027246 hasConceptScore W4288027246C2524010 @default.
• W4288027246 hasConceptScore W4288027246C311688 @default.
• W4288027246 hasConceptScore W4288027246C33923547 @default.
• W4288027246 hasConceptScore W4288027246C41008148 @default.
• W4288027246 hasConceptScore W4288027246C76220878 @default.
• W4288027246 hasConceptScore W4288027246C87117476 @default.
• W4288027246 hasLocation W42880272461 @default.
• W4288027246 hasOpenAccess W4288027246 @default.
• W4288027246 hasPrimaryLocation W42880272461 @default.
• W4288027246 hasRelatedWork W2023646228 @default.
• W4288027246 hasRelatedWork W2295961103 @default.
• W4288027246 hasRelatedWork W2569940161 @default.
• W4288027246 hasRelatedWork W2798395708 @default.
• W4288027246 hasRelatedWork W2956215892 @default.
• W4288027246 hasRelatedWork W2963258629 @default.
• W4288027246 hasRelatedWork W3035891971 @default.
• W4288027246 hasRelatedWork W4297749916 @default.
• W4288027246 hasRelatedWork W4316652316 @default.
• W4288027246 hasRelatedWork W974563791 @default.
• W4288027246 isParatext "false" @default.
• W4288027246 isRetracted "false" @default.
• W4288027246 workType "article" @default.