A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2-Reference-Cited by-同舟云学术

A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

Published:2009-03 Issue:2 Volume:5 Page:1-17
ISSN:1549-6325
Container-title:ACM Transactions on Algorithms
language:en
Short-container-title:ACM Trans. Algorithms

Author:

Even Guy¹,Feldman Jon²,Kortsarz Guy³,Nutov Zeev⁴

Affiliation:

1. Tel-Aviv University, Tel-Aviv, Israel

2. Google, NY

3. Rutgers University, Camden, NJ

4. The Open University of Israel, Raanana, Israel

Abstract

We present a 1.8-approximation algorithm for the following NP-hard problem: Given a connected graph G = ( V , E ) and an edge set E on V disjoint to E , find a minimum-size subset of edges F ⊆ E such that ( V , E ∪ F ) is 2-edge-connected. Our result improves and significantly simplifies the approximation algorithm with ratio 1.875 + ε of Nagamochi.

Funder

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/1497290.1497297

Reference13 articles.

1. Augmentation Problems

2. Approximation Algorithms for Several Graph Augmentation Problems

3. On the relationship between the biconnectivity augmentation and travelling salesman problems

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. 2-node-connectivity network design;Theoretical Computer Science;2024-03

2. Better-than-$$\frac{4}{3}$$-approximations for leaf-to-leaf tree and connectivity augmentation;Mathematical Programming;2023-09-26

3. A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree;SIAM Journal on Computing;2023-05-23

5. Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stronger Approaches;SIAM Journal on Computing;2023-04-12