Approximating Fractional Multicommodity Flow Independent of the Number of Commodities


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… (More)
DOI: 10.1109/SFFCS.1999.814573

4 Figures and Tables



Citations per Year

292 Citations

Semantic Scholar estimates that this publication has 292 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics