Sciweavers

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

107

Voted

SODA
2012
ACM

210views Algorithms» more SODA 2012»

Approximation algorithms and hardness of the k-route cut problem

13 years 5 months ago

Approximation algorithms and hardness of the k-route cut problem

Download ttic.uchicago.edu

Julia Chuzhoy, Yury Makarychev, Aravindan Vijayara

Real-time Traffic

Algorithms | SODA 2012 |

claim paper

Related Content

» Approximation and Hardness Results for Label Cut and Related Problems

» On the Hardness of Approximating Multicut and SparsestCut

» Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum kWay Cut...

» Hard constraint satisfaction problems have hard gaps at location 1

» How Do You Like Your Equilibrium Selection Problems Hard or Very Hard

» Improved approximation for directed cut problems

» Sampling subproblems of heterogeneous MaxCut problems and approximation algorithms

» A Unifying Approach to Hard and Probabilistic Clustering

» Polynomial flowcut gaps and hardness of directed cut problems

Post Info
More Details (n/a)

Added	28 Sep 2012
Updated	28 Sep 2012
Type	Journal
Year	2012
Where	SODA
Authors	Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou

Comments (0)