11 citations · 20 across the 7 of their papers we have counts for
1 paper · 1 filter
F. Bruce Shepherd, Adrian Vetta
We consider single-sink network flow problems. An instance consists of a capacitated graph (directed or undirected), a sink node t and a set of demands that we want to send to th…