Sciweavers

MP
2002
183views more  MP 2002»
13 years 4 months ago
On splittable and unsplittable flow capacitated network design arc-set polyhedra
We study the polyhedra of splittable and unsplittable single arc
Alper Atamtürk, Deepak Rajan
SIAMDM
2000
159views more  SIAMDM 2000»
13 years 4 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