Sciweavers

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

163

Voted

STOC
2012
ACM

227views Algorithms» more STOC 2012»

Approximation algorithms and hardness of integral concurrent flow

13 years 5 months ago

Approximation algorithms and hardness of integral concurrent flow

Download ttic.uchicago.edu

Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi

Real-time Traffic

Algorithms | STOC 2012 |

claim paper

Related Content

» An Olog k Approximate MinCut MaxFlow Theorem and Approximation Algorithm

» Incremental flow

» Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

» Approximating maximum integral flows in wireless sensor networks via weighteddegree constr...

» Almost tight bounds and existence theorems for confluent flows

» Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problem...

» Approximately counting integral flows and cellbounded contingency tables

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

» Optimization via communication networks

Post Info
More Details (n/a)

Added	28 Sep 2012
Updated	28 Sep 2012
Type	Journal
Year	2012
Where	STOC
Authors	Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li

Comments (0)