Region growing for multi-route cuts

Siddharth Barman, Shuchi Chawla

We study a number of multi-route cut problems: given a graph G=(V,E) and connectivity thresholds k_(u,v) on pairs of nodes, the goal is to find a minimum cost set of edges or verti…