Sciweavers

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

9

ALGORITHMICA
2007

favoriteEmaildiscussreport

85views more ALGORITHMICA 2007»

Approximation Algorithms for the Unsplittable Flow Problem

13 years 4 months ago

Approximation Algorithms for the Unsplittable Flow Problem

Download www.cs.dartmouth.edu

Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, A

Real-time Traffic

ALGORITHMICA 2007 |

claim paper

Related Content

» Combinatorial Algorithms for the Unsplittable Flow Problem

» Approximating the single source unsplittable mincost flow problem

» Flows on Few Paths Algorithms and Lower Bounds

» Convex Combinations of Single Source Unsplittable Flows

» A quasiPTAS for unsplittable flow on line graphs

» Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems

» Truthful Unsplittable Flow for Large Capacity Networks

» A Simple Greedy Algorithm for the kDisjoint Flow Problem

» Strongly Polynomial Algorithms for the Unsplittable Flow Problem

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2007
Where	ALGORITHMICA
Authors	Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar

Comments (0)