Search Sciweavers | Sciweavers

42 search results - page 2 / 9

» A Simple Local-Control Approximation Algorithm for Multicomm...

click to vote

SIAMDM
2000

159views more SIAMDM 2000»

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

13 years 7 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 »

click to vote

STOC
2010
ACM

186views Algorithms» more STOC 2010»

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

14 years 10 days 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

COMGEO
2012
ACM

275views Applied Computing» more COMGEO 2012»

Routing multi-class traffic flows in the plane

12 years 3 months ago

Download voronoi.ams.sunysb.edu

We study a class of multi-commodity ﬂow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...

Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...

claim paper

Read More »

click to vote

STOC
1991
ACM

95views Algorithms» more STOC 1991»

Fast Approximation Algorithms for Multicommodity Flow Problems

13 years 11 months ago

Download historical.ncstrl.org

Frank Thomson Leighton, Fillia Makedon, Serge A. P...

claim paper

Read More »