A $5$-Approximation Analysis for the Cover Small Cuts Problem

Miles Simmons, Ishan Bansal, Joe Cheriyan

In the Cover Small Cuts problem, we are given a capacitated (undirected) graph $G=(V,E,u)$ and a threshold value $\lambda$, as well as a set of links $L$ with end-nodes in $V$ and a non-…