A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The all-or-nothing flow problem in directed graphs with symmetric demand pairs

2014
*
Mathematical programming
*

We study the approximability of the All-or-Nothing multicommodity flow problem in directed graphs with symmetric demand pairs (SymANF). The input consists of a directed graph G = (V, E) and a collection of (unordered) pairs of nodes M = {s 1 t 1 , s 2 t 2 , . . . , s k t k }. A subset M of the pairs is routable if there is a feasible multicommodity flow in G such that, for each pair s i t i ∈ M , the amount of flow from s i to t i is at least one and the amount of flow from t i to s i is at

doi:10.1007/s10107-014-0856-z
fatcat:l4cjh42tf5evbeprkaikfqwlte