Sciweavers

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

79

Voted

FOCS
2009
IEEE

114views Theoretical Computer Science» more FOCS 2009»

Oblivious Routing for the Lp-norm

15 years 10 months ago

Oblivious Routing for the Lp-norm

Download www.dcs.warwick.ac.uk

Matthias Englert, Harald Räcke

Real-time Traffic

FOCS 2009 | Theoretical Computer Science |

claim paper

Related Content

» A Lower Bound for Oblivious Dimensional Routing

» Weighted random oblivious routing on torus networks

» Oblivious lowcongestion multicast routing in wireless networks

» Oblivious routing in directed graphs with random demands

» Online oblivious routing

» New Bounds for Oblivious Mesh Routing

» Oblivious routing on geometric networks

» Oblivious BuyatBulk in Planar Graphs

» Worstcase Traffic for Oblivious Routing Functions

» Dynamic vs Oblivious Routing in Network Design

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	FOCS
Authors	Matthias Englert, Harald Räcke

Comments (0)