A $2$-Approximation Algorithm for Flexible Graph Connectivity

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.

arXiv comment2 pages