Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
28
click to vote
SODA
2012
ACM
favorite
Email
discuss
report
210
views
Algorithms
»
more
SODA 2012
»
Approximation algorithms and hardness of the k-route cut problem
11 years 11 months ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision