Simple on-line algorithms for the maximum disjoint paths problem

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Petr Kolman Inst. for Theoretical Computer Science, Charles University, Malostranské nám. 25, 118 00 Prague, Czech Republic
Christian Scheideler Dept. of Computer Science, Johns Hopkins University, 3400 N. Charles Street, Baltimore, MD
Published in:
Cover Image
 
· Proceeding
SPAA '01 Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Pages 38-47
ACM New York, NY, USA ©2001
table of contents ISBN:1-58113-409-6 doi>10.1145/378580.378586
Simple on-line algorithms for the maximum disjoint paths problem Published by ACM 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 362
· Citation Count: 9


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