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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
102
click to vote
FOCS
1993
IEEE
61
views
Theoretical Computer Science
»
more
FOCS 1993
»
A Simple Local-Control Approximation Algorithm for Multicommodity Flow
15 years 7 months ago
Download
www.cs.jhu.edu
Baruch Awerbuch, Frank Thomson Leighton
Real-time Traffic
FOCS 1993
|
Theoretical Computer Science
|
claim paper
Related Content
»
A simple method for improving the primal simplex method for the multicommodity flow proble...
»
Approximate duality of multicommodity multiroute flows and cuts single source case
»
A Simple Greedy Algorithm for the kDisjoint Flow Problem
»
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
»
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
»
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph...
»
Routing multiclass traffic flows in the plane
»
Fast Approximation Algorithms for Multicommodity Flow Problems
»
Provably good global routing by a new approximation algorithm for multicommodity flow
more »
Post Info
More Details (n/a)
Added
08 Aug 2010
Updated
08 Aug 2010
Type
Conference
Year
1993
Where
FOCS
Authors
Baruch Awerbuch, Frank Thomson Leighton
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision