ε)-approximation schemes

129

Voted

STOC
2010
ACM

186views Algorithms» more STOC 2010»

Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms

15 years 7 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

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Sciweavers