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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
144
click to vote
FOCS
2009
IEEE
138
views
Theoretical Computer Science
»
more
FOCS 2009
»
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
15 years 10 months ago
Download
people.csail.mit.edu
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
claim paper
Read More »