Matches in SemOpenAlex for { <https://semopenalex.org/work/W2962680238> ?p ?o ?g. }
Showing items 1 to 93 of
93
with 100 items per page.
- W2962680238 endingPage "168" @default.
- W2962680238 startingPage "145" @default.
- W2962680238 abstract "The tree augmentation problem (TAP) is a fundamental network design problem, in which the input is a graph G and a spanning tree T for it, and the goal is to augment T with a minimum set of edges Aug from G, such that $$T cup Aug$$ is 2-edge-connected. TAP has been widely studied in the sequential setting. The best known approximation ratio of 2 for the weighted case dates back to the work of Frederickson and JáJá (SIAM J Comput 10(2):270–283, 1981). Recently, a 3/2-approximation was given for unweighted TAP by Kortsarz and Nutov (ACM Trans Algorithms 12(2):23, 2016). Recent breakthroughs give an approximation of 1.458 for unweighted TAP (Grandoni et al. in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing (STOC 2018), 2018), and approximations better than 2 for bounded weights (Adjiashvili in: Proceedings of the twenty-eighth annual ACM-SIAM symposium on discrete algorithms (SODA), 2017; Fiorini et al. in: Proceedings of the twenty-ninth annual ACM-SIAM symposium on discrete algorithms (SODA 2018), New Orleans, LA, USA, 2018. https://doi.org/10.1137/1.9781611975031.53). In this paper, we provide the first fast distributed approximations for TAP. We present a distributed 2-approximation for weighted TAP which completes in O(h) rounds, where h is the height of T. When h is large, we show a much faster 4-approximation algorithm for the unweighted case, completing in $$O(D+sqrt{n}log ^*{n})$$ rounds, where n is the number of vertices and D is the diameter of G. Immediate consequences of our results are an O(D)-round 2-approximation algorithm for the minimum size 2-edge-connected spanning subgraph, which significantly improves upon the running time of previous approximation algorithms, and an $$O(h_{MST}+sqrt{n}log ^{*}{n})$$-round 3-approximation algorithm for the weighted case, where $$h_{MST}$$ is the height of the MST of the graph. Additional applications are algorithms for verifying 2-edge-connectivity and for augmenting the connectivity of any connected spanning subgraph to 2. Finally, we complement our study with proving lower bounds for distributed approximations of TAP." @default.
- W2962680238 created "2019-07-30" @default.
- W2962680238 creator A5052412504 @default.
- W2962680238 creator A5061279024 @default.
- W2962680238 date "2019-05-16" @default.
- W2962680238 modified "2023-09-23" @default.
- W2962680238 title "Fast distributed approximation for TAP and 2-edge-connectivity" @default.
- W2962680238 cites W1508113861 @default.
- W2962680238 cites W1596370873 @default.
- W2962680238 cites W1974912205 @default.
- W2962680238 cites W1980229659 @default.
- W2962680238 cites W1983097829 @default.
- W2962680238 cites W1984090926 @default.
- W2962680238 cites W1996575062 @default.
- W2962680238 cites W2002452451 @default.
- W2962680238 cites W2005900781 @default.
- W2962680238 cites W2007004331 @default.
- W2962680238 cites W2027018686 @default.
- W2962680238 cites W2051699458 @default.
- W2962680238 cites W2054910423 @default.
- W2962680238 cites W2070486524 @default.
- W2962680238 cites W2077371116 @default.
- W2962680238 cites W2083323175 @default.
- W2962680238 cites W2092113566 @default.
- W2962680238 cites W2128823163 @default.
- W2962680238 cites W2163097371 @default.
- W2962680238 cites W2172955861 @default.
- W2962680238 cites W2287418059 @default.
- W2962680238 cites W2467525240 @default.
- W2962680238 cites W2592535728 @default.
- W2962680238 cites W2777560552 @default.
- W2962680238 cites W2803918337 @default.
- W2962680238 cites W2963193695 @default.
- W2962680238 cites W2963355678 @default.
- W2962680238 cites W2963420932 @default.
- W2962680238 cites W2963550906 @default.
- W2962680238 cites W4205300528 @default.
- W2962680238 cites W4233583517 @default.
- W2962680238 doi "https://doi.org/10.1007/s00446-019-00353-3" @default.
- W2962680238 hasPublicationYear "2019" @default.
- W2962680238 type Work @default.
- W2962680238 sameAs 2962680238 @default.
- W2962680238 citedByCount "2" @default.
- W2962680238 countsByYear W29626802382020 @default.
- W2962680238 countsByYear W29626802382022 @default.
- W2962680238 crossrefType "journal-article" @default.
- W2962680238 hasAuthorship W2962680238A5052412504 @default.
- W2962680238 hasAuthorship W2962680238A5061279024 @default.
- W2962680238 hasBestOaLocation W29626802382 @default.
- W2962680238 hasConcept C113174947 @default.
- W2962680238 hasConcept C11413529 @default.
- W2962680238 hasConcept C114614502 @default.
- W2962680238 hasConcept C118615104 @default.
- W2962680238 hasConcept C134306372 @default.
- W2962680238 hasConcept C148764684 @default.
- W2962680238 hasConcept C33923547 @default.
- W2962680238 hasConcept C34388435 @default.
- W2962680238 hasConcept C41008148 @default.
- W2962680238 hasConcept C76220878 @default.
- W2962680238 hasConceptScore W2962680238C113174947 @default.
- W2962680238 hasConceptScore W2962680238C11413529 @default.
- W2962680238 hasConceptScore W2962680238C114614502 @default.
- W2962680238 hasConceptScore W2962680238C118615104 @default.
- W2962680238 hasConceptScore W2962680238C134306372 @default.
- W2962680238 hasConceptScore W2962680238C148764684 @default.
- W2962680238 hasConceptScore W2962680238C33923547 @default.
- W2962680238 hasConceptScore W2962680238C34388435 @default.
- W2962680238 hasConceptScore W2962680238C41008148 @default.
- W2962680238 hasConceptScore W2962680238C76220878 @default.
- W2962680238 hasFunder F4320322252 @default.
- W2962680238 hasIssue "2" @default.
- W2962680238 hasLocation W29626802381 @default.
- W2962680238 hasLocation W29626802382 @default.
- W2962680238 hasLocation W29626802383 @default.
- W2962680238 hasOpenAccess W2962680238 @default.
- W2962680238 hasPrimaryLocation W29626802381 @default.
- W2962680238 hasRelatedWork W2056824842 @default.
- W2962680238 hasRelatedWork W2090953203 @default.
- W2962680238 hasRelatedWork W2097945626 @default.
- W2962680238 hasRelatedWork W2098907131 @default.
- W2962680238 hasRelatedWork W2154295079 @default.
- W2962680238 hasRelatedWork W2407277019 @default.
- W2962680238 hasRelatedWork W2963258629 @default.
- W2962680238 hasRelatedWork W3023282321 @default.
- W2962680238 hasRelatedWork W3094179009 @default.
- W2962680238 hasRelatedWork W3194189065 @default.
- W2962680238 hasVolume "33" @default.
- W2962680238 isParatext "false" @default.
- W2962680238 isRetracted "false" @default.
- W2962680238 magId "2962680238" @default.
- W2962680238 workType "article" @default.