2000 character limit reached
Improved approximation ratio for covering pliable set families (2404.00683v1)
Published 31 Mar 2024 in cs.DS
Abstract: A classic result of Williamson, Goemans, Mihail, and Vazirani [STOC 1993: 708-717] states that the problem of covering an uncrossable set family by a min-cost edge set admits approximation ratio $2$, by a primal-dual algorithm with a reverse delete phase. Recently, Bansal, Cheriyan, Grout, and Ibrahimpur [ICALP 2023: 15:1-15:19] showed that this algorithm achieves approximation ratio $16$ for a larger class of set families, that have much weaker uncrossing properties. In this paper we will refine their analysis and show an approximation ratio of $10$. This also improves approximation ratios for several variants of the Capacitated $k$-Edge Connected Spanning Subgraph problem.
- Flexible graph connectivity. Mathematical Programming, pages 1–33, 2021.
- When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM J. on Computing, 24(3):440–456, 1995.
- I. Bansal. A constant factor approximation for the (p,3)𝑝3(p,3)( italic_p , 3 )-flexible graph connectivity problem. CoRR, abs/2308.15714, August 2023. URL: https://doi.org/10.48550/arXiv.2308.15714.
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions. In ICALP, pages 15:1–15:19, 2023.
- Approximation algorithms for flexible graph connectivity. In FSTTCS, page 9:1–9:14, 2021.
- C. Chekuri and R. Jain. Approximation algorithms for network design in non-uniform fault models. In ICALP, volume 261, pages 36:1–36:20, 2023.
- A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296–317, 1995.
- Z. Nutov. Extending the primal-dual 2-approximation algorithm beyond uncrossable set families. CoRR, abs/2307.08270, 2023. URL: https://doi.org/10.48550/arXiv.2307.08270, arXiv:2307.08270.
- Zeev Nutov. Improved approximation algorithms for some capacitated k𝑘kitalic_k edge connectivity problems. CoRR, abs/2307.01650, July 2023.
- V. V. Vazirani. Approximation Algorithms. Springer, 2001.
- A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica, 15(3):435–454, 1995.