A $2$-Approximation Algorithm for Flexible Graph Connectivity
Data Structures and Algorithms
2021-02-08 v1 Discrete Mathematics
Abstract
We present a 2-approximation algorithm for the Flexible Graph Connectivity problem [AHM20] via a reduction to the minimum cost r-out 2-arborescence problem.
Keywords
Cite
@article{arxiv.2102.03304,
title = {A $2$-Approximation Algorithm for Flexible Graph Connectivity},
author = {Sylvia Boyd and Joseph Cheriyan and Arash Haddadan and Sharat Ibrahimpur},
journal= {arXiv preprint arXiv:2102.03304},
year = {2021}
}
Comments
2 pages
Related papers
View all related →
Data Structures and Algorithms · Computer Science
Approximation Algorithms for Flexible Graph Connectivity
Sylvia Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
2022-03-01
Data Structures and Algorithms · Computer Science
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
2020-01-14
Data Structures and Algorithms · Computer Science
Improved Approximations for Flexible Network Design
Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanita
2024-04-16
Data Structures and Algorithms · Computer Science
Engineering Weighted Connectivity Augmentation Algorithms
Marcelo Fonseca Faraj, Ernestine Großmann, Felix Joos, Thomas Möller +1
2024-02-13
Data Structures and Algorithms · Computer Science
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs
Stephan Beyer, Markus Chimani, Joachim Spoerhase
2018-11-21
Data Structures and Algorithms · Computer Science
Breaching the 2-Approximation Barrier for the Forest Augmentation Problem
Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub
2022-04-21
Data Structures and Algorithms · Computer Science
An Improved Approximation Algorithm for the Matching Augmentation Problem
J. Cheriyan, R. Cummings, J. Dippel, J. Zhu
2020-12-14
Data Structures and Algorithms · Computer Science
A 17/12-Approximation Algorithm for 2-Vertex-Connected Spanning Subgraphs on Graphs with Minimum Degree At Least 3
Vishnu V. Narayan
2017-01-18
Data Structures and Algorithms · Computer Science
Approximation algorithms for connectivity augmentation problems
Zeev Nutov
2020-11-17
Data Structures and Algorithms · Computer Science
A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
Guy Kortsarz, Zeev Nutov
2015-07-13
Data Structures and Algorithms · Computer Science
A New Approximation Algorithm for the Minimum 2-Edge-Connected Spanning Subgraph Problem
Ali Çivril
2023-05-10
Data Structures and Algorithms · Computer Science
Performance evaluation of approximation algorithms for the minimum size 2-vertex strongly connected subgraph problem
Azzam Habib
2022-10-19
Data Structures and Algorithms · Computer Science
A practical algorithm for 2-admissibility
Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl
2025-05-08
Data Structures and Algorithms · Computer Science
Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
Ishan Bansal, Joseph Cheriyan, Sanjeev Khanna, Miles Simmons
2026-04-07
Discrete Mathematics · Computer Science
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs
Joseph Cheriyan, Laszlo A. Vegh
2012-12-18
Populations and Evolution · Quantitative Biology
A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks
Martin Frohn, Steven Kelk
2025-01-14
Data Structures and Algorithms · Computer Science
Dual Half-integrality for Uncrossable Cut Cover and its Application to Maximum Half-Integral Flow
Naveen Garg, Nikhil Kumar
2020-07-29
Data Structures and Algorithms · Computer Science
A $(1.5+\epsilon)$-Approximation Algorithm for Weighted Connectivity Augmentation
Vera Traub, Rico Zenklusen
2022-09-19
Data Structures and Algorithms · Computer Science
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-free Two-Edge-Cover
Yusuke Kobayashi, Takashi Noguchi
2023-04-27
Data Structures and Algorithms · Computer Science
3/2-Approximation for the Forest Augmentation Problem
Ali Çivril
2024-10-28
Data Structures and Algorithms · Computer Science
Augmentation based Approximation Algorithms for Flexible Network Design
Chandra Chekuri, Rhea Jain
2022-09-27
Data Structures and Algorithms · Computer Science
Approximating the Arboricity in Sublinear Time
Talya Eden, Saleet Mossel, Dana Ron
2021-10-29
Data Structures and Algorithms · Computer Science
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest
Frans Schalekamp, Anke van Zuylen, Suzanne van der Ster
2016-04-29
Data Structures and Algorithms · Computer Science
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
Mingyu Xiao, Leizhen Cai, Andrew C. Yao
2008-11-25
Data Structures and Algorithms · Computer Science
Approximating Flexible Graph Connectivity via R\"acke Tree based Rounding
Chandra Chekuri, Rhea Jain
2022-11-16