Sciweavers

125

MP
2002

183views more MP 2002»

On splittable and unsplittable flow capacitated network design arc-set polyhedra

15 years 2 months ago

On splittable and unsplittable flow capacitated network design arc-set polyhedra

Download www.ieor.berkeley.edu

We study the polyhedra of splittable and unsplittable single arc

Alper Atamtürk, Deepak Rajan

claim paper

Read More »

130

SIAMDM
2000

159views more SIAMDM 2000»

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

15 years 2 months ago

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

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 »