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
.
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
2000
SIAM Journal on Discrete Mathematics
We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation scheme for maximum multicommodity flow that is independent of the number of commodities k, and our algorithm improves upon the runtime of previous algorithms by this factor of k, running in O * ( −2 m 2 ) time. For maximum concurrent flow, and minimum cost concurrent flow, we present algorithms that are faster than the current
doi:10.1137/s0895480199355754
fatcat:cxubrv77xbb6njqeet6sbiuc6q