An optimal online algorithm for packet scheduling with agreeable deadlines

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Fei Li Columbia U.
Jay Sethuraman Columbia U.
Clifford Stein Columbia U.
Published in:
· Proceeding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Pages 801-802
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2005
table of contents ISBN:0-89871-585-7
An optimal online algorithm for packet scheduling with agreeable deadlines 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 38
· Downloads (cumulative): 476
· Citation Count: 25


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