Fast distributed approximation for TAP and 2-edge-connectivity

被引:0
|
作者
Keren Censor-Hillel
Michal Dory
机构
[1] Technion,Department of Computer Science
来源
Distributed Computing | 2020年 / 33卷
关键词
Distributed graph algorithms; Approximation algorithms; Distributed network design; Connectivity augmentation;
D O I
暂无
中图分类号
学科分类号
摘要
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∪Aug\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T \cup Aug$$\end{document} 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+nlog∗n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(D+\sqrt{n}\log ^*{n})$$\end{document} 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(hMST+nlog∗n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(h_{MST}+\sqrt{n}\log ^{*}{n})$$\end{document}-round 3-approximation algorithm for the weighted case, where hMST\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$h_{MST}$$\end{document} 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.
引用
收藏
页码:145 / 168
页数:23
相关论文
共 50 条
  • [1] Fast distributed approximation for TAP and 2-edge-connectivity
    Censor-Hillel, Keren
    Dory, Michal
    [J]. DISTRIBUTED COMPUTING, 2020, 33 (02) : 145 - 168
  • [2] A faster approximation algorithm for 2-edge-connectivity augmentation
    Galluccio, A
    Proietti, G
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 150 - 162
  • [3] A 5/4-approximation algorithm for minimum 2-edge-connectivity
    Jothi, R
    Raghavachari, B
    Varadarajan, S
    [J]. PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 725 - 734
  • [4] FULLY DYNAMIC 2-EDGE-CONNECTIVITY IN PLANAR GRAPHS
    HERSHBERGER, J
    RAUCH, M
    SURI, S
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 621 : 233 - 244
  • [5] A simple test on 2-vertex- and 2-edge-connectivity
    Schmidt, Jens M.
    [J]. INFORMATION PROCESSING LETTERS, 2013, 113 (07) : 241 - 244
  • [6] A Computational Investigation of Heuristic Algorithms for 2-Edge-Connectivity Augmentation
    Bang-Jensen, Jorgen
    Chiarandini, Marco
    Morling, Peter
    [J]. NETWORKS, 2010, 55 (04) : 299 - 325
  • [7] Polynomial time algorithms for 2-edge-connectivity augmentation problems
    Galluccio, A
    Proietti, G
    [J]. ALGORITHMICA, 2003, 36 (04) : 361 - 374
  • [8] Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity
    Akitaya, Hugo Alves
    Castello, Jonathan
    Lahoda, Yauheniya
    Rounds, Anika
    Toth, Csaba D.
    [J]. GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2015, 2015, 9411 : 563 - 564
  • [9] Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems
    Anna Galluccio
    Guido Proietti
    [J]. Algorithmica, 2003, 36 : 361 - 374
  • [10] Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Papadopoulos, Charis
    Parotsidis, Nikos
    [J]. ALGORITHMS - ESA 2015, 2015, 9294 : 582 - 594