Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

IPCO
2001

favoriteEmaildiscussreport

86views Optimization» more IPCO 2001»

Strongly Polynomial Algorithms for the Unsplittable Flow Problem

14 years 8 days ago

Strongly Polynomial Algorithms for the Unsplittable Flow Problem

Download www.cs.technion.ac.il

Yossi Azar, Oded Regev

Real-time Traffic

IPCO 2001 | IPCO 2007 |

claim paper

Related Content

» Convex Combinations of Single Source Unsplittable Flows

» A quasiPTAS for unsplittable flow on line graphs

» Minimum ratio canceling is oracle polynomial for linear programming but not strongly polyn...

» Flows on Few Paths Algorithms and Lower Bounds

» Combinatorial Algorithms for the Unsplittable Flow Problem

» Approximation Algorithms for the Unsplittable Flow Problem

» Approximating the single source unsplittable mincost flow problem

» The Train Delivery Problem Vehicle Routing Meets Bin Packing

» Truthful Unsplittable Flow for Large Capacity Networks

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	IPCO
Authors	Yossi Azar, Oded Regev

Comments (0)