Sciweavers

2 search results - page 1 / 1
» Faster approximation schemes for fractional multicommodity f...
Sort
View
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
13 years 10 months ago
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
Aleksander Madry
SIAMDM
2000
159views more  SIAMDM 2000»
13 years 5 months ago
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Abstract. 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...
Lisa Fleischer