A 2-Approximation Algorithm for Flexible Graph Connectivity

02/05/2021

∙

by   Sylvia Boyd, et al.

∙

0

∙

share

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.