Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size

  • Ankur Moitra
  • Published 2009 in
    2009 50th Annual IEEE Symposium on Foundations of…


Linial, London and Rabinovich and Aumann and Rabani proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are $k$ commodities) is $O(\log k)$. Here we attempt to derive a more general theory of Steiner cut and flow problems, and we prove bounds that are poly-logarithmic in $k$ for a much broader class of… (More)
DOI: 10.1109/FOCS.2009.28
View Slides



Citations per Year

64 Citations

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

See our FAQ for additional information.

  • Presentations referencing similar topics