Breaching the 2-approximation barrier for the forest augmentation problem-Reference-Cited by-同舟云学术

Breaching the 2-approximation barrier for the forest augmentation problem

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Grandoni Fabrizio¹,Ameli Afrouz Jabal¹,Traub Vera²

Affiliation:

1. USI-SUPSI, Switzerland

2. ETH Zurich, Switzerland

Publisher

ACM

Link

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

Reference28 articles.

1. Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs

2. Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree

3. Steiner Tree Approximation via Iterative Randomized Rounding

4. Bridging the gap between tree and connectivity augmentation: unified and stronger approaches

5. Joseph Cheriyan , Robert Cummings , Jack Dippel , and Jasper Zhu . 2020. An Improved Approximation Algorithm for the Matching Augmentation Problem. CoRR, abs/2007.11559 ( 2020 ), arxiv:2007.11559. arxiv:2007.11559 Joseph Cheriyan, Robert Cummings, Jack Dippel, and Jasper Zhu. 2020. An Improved Approximation Algorithm for the Matching Augmentation Problem. CoRR, abs/2007.11559 (2020), arxiv:2007.11559. arxiv:2007.11559

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

1. Ghost Value Augmentation for k-Edge-Connectivity;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

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

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

4. An Improved Approximation Algorithm for the Matching Augmentation Problem;SIAM Journal on Discrete Mathematics;2023-01-20

5. A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem;Integer Programming and Combinatorial Optimization;2022