2021/02/05 by Boyd, Sylvia, Cheriyan, Joseph, Haddadan, Arash +1
#Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.1.6 #G.2.2
paper · doi:10.48550/arxiv.2102.03304
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.