A practical algorithm for constructing oblivious routing schemes

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Marcin Bienkowski Paderborn University, Germany
Miroslaw Korzeniowski Paderborn University, Germany
Harald Räcke Paderborn University, Germany
Published in:
Cover Image
 
· Proceeding
SPAA '03 Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Pages 24 - 33
ACM New York, NY, USA ©2003
table of contents ISBN:1-58113-661-7 doi>10.1145/777412.777418
A practical algorithm for constructing oblivious routing schemes Published by ACM 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 41
· Downloads (cumulative): 610
· Citation Count: 31


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