22 citations · 121 across the 43 of their papers we have counts for
1 paper · 2 filters
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…