Search Sciweavers | Sciweavers

2 search results - page 1 / 1

» Faster approximation schemes for fractional multicommodity f...

click to vote

STOC
2010
ACM

186views Algorithms» more STOC 2010»

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

13 years 9 months ago

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

Download people.csail.mit.edu

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 »

click to vote

SIAMDM
2000

159views more SIAMDM 2000»

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

13 years 4 months ago

Download www.cs.dartmouth.edu

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

claim paper

Read More »

« Prev « First page 1 / 1 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers