Sciweavers

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

9

STOC
2005
ACM

favoriteEmaildiscussreport

104views Algorithms» more STOC 2005»

Oblivious routing in directed graphs with random demands

14 years 4 months ago

Oblivious routing in directed graphs with random demands

Download www-math.mit.edu

Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leig

Real-time Traffic

Algorithms | Oblivious Routing | STOC 2005 |

claim paper

Related Content

» Semioblivious routing

» Online oblivious routing

» Oblivious routing on geometric networks

» Dynamic vs Oblivious Routing in Network Design

» Random Walk on Directed Dynamic Graphs

» Weighted random oblivious routing on torus networks

» Oblivious Routing in OnChip BandwidthAdaptive Networks

» Oblivious BuyatBulk in Planar Graphs

» Online ThroughputCompetitive Algorithm for Multicast Routing and Admission Control

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2005
Where	STOC
Authors	Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke

Comments (0)