A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation
Pages 1820 - 1833
Abstract
Connectivity augmentation problems are among the most elementary questions in Network Design. Many of these problems admit natural 2-approximation algorithms, often through various classic techniques, whereas it remains open whether approximation factors below 2 can be achieved. One of the most basic examples thereof is the Weighted Connectivity Augmentation Problem (WCAP). In WCAP, one is given an undirected graph together with a set of additional weighted candidate edges, and the task is to find a cheapest set of candidate edges whose addition to the graph increases its edge-connectivity. We present a (1.5+ε)-approximation algorithm for WCAP, showing for the first time that factors below 2 are achievable.
On a high level, we design a well-chosen local search algorithm, inspired by recent advances for Weighted Tree Augmentation. To measure progress, we consider a directed weakening of WCAP and show that it has highly structured planar solutions. Interpreting a solution of the original problem as one of this directed weakening allows us to describe local exchange steps in a clean and algorithmically amenable way. Leveraging these insights, we show that we can efficiently search for good exchange steps within a component class of link sets that is closely related to bounded treewidth subgraphs of circle graphs. Moreover, we prove that an optimum solution can be decomposed into smaller components, at least one of which leads to a good local search step as long as we did not yet achieve the claimed approximation guarantee.
References
[1]
D. Adjiashvili. 2018. Beating approximation factor two for weighted tree augmentation with bounded costs. ACM Transactions on Algorithms, 15, 2, 19 : 1-19 : 26.
[2]
H. Angelidakis, D. Hyatt-Denesik, and L. Sanitá. 2022. Node connectivity augmentation via iterative randomized rounding. Mathematical Programming.
[3]
É. Bamas, M. Drygala, and O. Svensson. 2022. A simple LP-based approximation algorithm for the matching augmentation problem. In Proceedings of the International Conference on Integer Programming and Combinatorial Optimization (IPCO), 57-69.
[4]
Saurabh. 2014. Parameterized algorithms to preserve connectivity. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP), 800-811.
[5]
J. Byrka, F. Grandoni, and A. Jabal Ameli. 2020. Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree. In Proceedings of the 52nd ACM Symposium on Theory of Computing (STOC). 7713.3384301.
[6]
F. Cecchetto, V. Traub, and R. Zenklusen. 2021. Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. In Proceedings of the 53rd Annual ACM Symposium on Theory of Computing (STOC), 370-383.
[8]
J. Cheriyan, R Cummings, J. Dippel, and J. Zhu. 2023. An improved approximation algorithm for the matching augmentation problem. SIAM Journal on Discrete Mathematics, 37, 1.
[9]
J. Cheriyan, J. Dippel, F. Grandoni, A. Khan, and V. V. Narayan. 2020. The matching augmentation problem: a 74-approximation algorithm. Mathematical Programming, 182, 315-354.
[10]
J. Cheriyan and Z. Gao. 2018. Approximating (unweighted) tree augmentation via lift-and-project, part I: stemless TAP. Algorithmica, 80, 530-559. 07/s00453-016-0270-4.
[11]
J. Cheriyan and Z. Gao. 2018. Approximating (unweighted) tree augmentation via lift-and-project, part II. Algorithmica, 80, 2, 608-651. 17-0275-7.
[12]
J. Cheriyan, H. Karlof, R. Khandekar, and J. Könemann. 2008. On the integrality ratio for tree augmentation. Operations Research Letters, 36, 4, 399-401. 2008. 01.009.
[13]
J. Cheriyan and R. Thurimella. 2000. Approximating minimum-size-connected spanning subgraphs via matching. SIAM Journal on Computing, 30, 2, 528-560.
[15]
N. Cohen and Z. Nutov. 2013. A (1 + ln 2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius.
[16]
Theoretical Computer Science, 489, 67-74. 2013. 04.004.
[17]
J. Davies and R. McCarty. 2021. Circle graphs are quadratically-bounded.
[18]
Bulletin of the London Mathematical Society, 53, 673-679. 47.
[19]
E. A. Dinitz, A. V. Karzanov, and M. V. Lomonosov. 1976. On the structure of the system of minimum edge cuts of a graph. Studies in Discrete Optimization, 290-306.
[20]
G. Even, J. Feldman, G. Kortsarz, and Z. Nutov. 2009. A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. ACM Transactions on Algorithms, 5, 2, 21 : 1-21 : 17.
[21]
S. Fiorini, M. Groß, J. Könemann, and L. Sanità. 2018. Approximating weighted tree augmentation via Chvátal-Gomory Cuts. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 817-831.
[22]
A. Frank and É. Tardos. 1989. An application of submodular flows. Linear Algebra and its Applications, 114-115, 329-348. 0024-3795 ( 89 )9046 9-2.
[23]
G. N. Frederickson and J. JáJá. 1981. Approximation algorithms for several graph augmentation problems. SIAM Journal on Computing, 10, 2, 270-283.
[25]
H. N. Gabow. 2004. Special edges, and approximating the smallest directed-edge connected subgraph. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 234-243.
[26]
H. N. Gabow, M. X. Goemans, É. Tardos, and D. P. Williamson. 2009. Approximating the smallest-edge connected spanning subgraph by lp-rounding.
[27]
Networks, 53, 4, 345-357.
[28]
W. Gálvez, F. Grandoni, A. Jabal Ameli, and K. Sornat. 2021. On the cycle augmentation problem: hardness and approximation algorithms. Theory of Computing Systems, 65, 985-1008.
[29]
M. R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitriou. 1980. The complexity of coloring circular arcs and chords. SIAM Journal on Algebraic Discrete Methods, 1, 2, 216-227.
[30]
M. Garg, F. Hommelsheim, and N. Megow. 2022. Matching augmentation via simultaneous contractions. ( 2022 ). 01912.
[31]
F. Gavril. 1973. Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks, 3, 3, 261-273.
[32]
Williamson. 1994. Improved approximation algorithms for network design problems. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 223-232.
[33]
F. Grandoni, A. Jabal Ameli, and V. Traub. 2022. Breaching the 2-approximation barrier for the forest augmentation problem. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC), 1598-1611.
[34]
F. Grandoni, C. Kalaitzis, and R. Zenklusen. 2018. Improved approximation for tree augmentation: saving by rewiring. In Proceedings of 50th ACM Symposium on Theory of Computing (STOC), 632-645.
[35]
A. Gyárfás. 1985. On the chromatic number of multiple interval graphs and overlap graphs. Discrete Mathematics, 55, 161-166. 0012-365X ( 85 ) 90044-5.
[36]
K. Jain. 2001. A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica, 21, 39-60.
[37]
J. M. Keil. 1993. The complexity of domination problems in circle graphs.
[38]
Discrete Applied Mathematics, 42, 51-63. 0166-218X ( 93 ) 90178-Q.
[39]
S. Khuller and R. Thurimella. 1993. Approximation algorithms for graph augmentation. Journal of Algorithms, 14, 2, 214-225. 1993. 1010.
[40]
S. Khuller and U. Vishkin. 1994. Biconnectivity approximations and graph carvings. Journal of the ACM, 41, 2, 214-235.
[41]
T. Kloks. 1996. Treewidth of circle graphs. International Journal of Foundations of Computer Science, 7, 2, 111-120.
[42]
G. Kortsarz and Z. Nutov. 2016. A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. ACM Transactions on Algorithms, 12, 2, 23 : 1-23 : 20.
[43]
G. Kortsarz and Z. Nutov. 2018. LP-relaxations for tree augmentation. Discrete Applied Mathematics, 239, 94-105. 2017. 12.033.
[44]
H. Nagamochi. 2003. An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. Discrete Applied Mathematics, 126, 1, 83-113. S0166-218X( 02 ) 00218-4.
[45]
N. Nash and D. Gregg. 2010. An output sensitive algorithm for computing a maximum independent set of a circle graph. Information Processing Letters, 110, 630-634. 2010. 05.016.
[46]
Z. Nutov. 2021. Approximation algorithms for connectivity augmentation problems. In Proceedings of the 16th International Computer Science Symposium in Russia (CSR), 321-338.
[47]
Z. Nutov. 2017. On the tree augmentation problem. In Proceedings of 25th Annual Symposium on Algorithms (ESA), 61 : 1-61 : 14.
[48]
J. Spinrad. 1994. Recognition of circle graphs. Journal of Algorithms, 16, 264-282. 1994. 1012.
[49]
A. Tiskin. 2015. Fast distance multiplication of unit-monge matrices. Algorithmica, 71, 859-888.
[50]
V. Traub and R. Zenklusen. 2022. A (1.5 + )-approximation algorithm for weighted connectivity augmentation. https://arxiv.org/abs/2209.07860. ( 2022 ).
[51]
V. Traub and R. Zenklusen. 2021. A better-than-2 approximation algorithm for weighted tree augmentation. In Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, (FOCS), 1-12. 1.00010.
[52]
V. Traub and R. Zenklusen. 2022. Local search for weighted tree augmentation and Steiner tree. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA, 3253-3272.
[53]
W. Unger. 1988. On the-colouring or circle-graphs. In Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science (STACS), 61-72.
Index Terms
- A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation
Recommendations
An approximation algorithm for the partial vertex cover problem in hypergraphs
Let $$\mathcal {H}=(V,\mathcal {E})$$H=(V,E) be a hypergraph with set of vertices $$V, n:=|V|$$V,n:=|V| and set of (hyper-)edges $$\mathcal {E}, m:=|\mathcal {E}|$$E,m:=|E|. Let $$l$$l be the maximum size of an edge, $$\varDelta $$Δ be the maximum ...
Constant factor approximation for the weighted partial degree bounded edge packing problem
In the partial degree bounded edge packing problem (PDBEP), the input is an undirected graph $$G=(V,E)$$G=(V,E) with capacity $$c_v\in {\mathbb {N}}$$cvýN on each vertex v. The objective is to find a feasible subgraph $$G'=(V,E')$$Gý=(V,Eý) maximizing $$...
Approximating Rooted Connectivity Augmentation Problems
A graph is called {\em $\el$-connected from $U$ to $r$} if there are $\el$ internally disjoint paths from every node $u \in U$ to $r$. The {\em Rooted Subset Connectivity Augmentation Problem} ({\em RSCAP}) is as follows: given a graph $G=(V+r,E)$, a ...
Comments
Information & Contributors
Information
Published In
June 2023
1926 pages
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 02 June 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Swiss National Science Foundation
- European Research Council
Conference
STOC '23
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 132Total Downloads
- Downloads (Last 12 months)117
- Downloads (Last 6 weeks)2
Reflects downloads up to 26 Jul 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in