Minimizing average latency in oblivious routing

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Prahladh Harsha Toyota Technological Institute, Chicago
Thomas P. Hayes Toyota Technological Institute, Chicago
Hariharan Narayanan University of Chicago
Harald Räcke University of Warwick, Coventry, UK
Jaikumar Radhakrishnan Tata Institute of Fundamental Research, Mumbai, India
Minimizing average latency in oblivious routing 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 12
· Downloads (cumulative): 184
· Citation Count: 4

Published in:
· Proceeding
SODA '08 Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Pages 200-207
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2008
table of contents

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder