Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

STOC
1991
ACM

favoriteEmaildiscussreport

95views Algorithms» more STOC 1991»

Fast Approximation Algorithms for Multicommodity Flow Problems

13 years 7 months ago

Fast Approximation Algorithms for Multicommodity Flow Problems

Download historical.ncstrl.org

Frank Thomson Leighton, Fillia Makedon, Serge A. P

Real-time Traffic

Algorithms | STOC 1991 |

claim paper

Related Content

» Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problem...

» Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems

» Faster approximation schemes for fractional multicommodity flow problems via dynamic graph...

» Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

» Approximate duality of multicommodity multiroute flows and cuts single source case

» Provisioning a virtual private network a network design problem for multicommodity flow

» Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flo...

» A fixedparameter tractability result for multicommodity demand flow in trees

» Incremental flow

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	STOC
Authors	Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas

Comments (0)