ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Approximation algorithms for time-constrained scheduling on line networks

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Harald Räcke University of Warwick, Coventry CV4 7AL, Germany
Adi Rosén CNRS and University of Paris 11, 91405 Orsay, France
Published in:
Cover Image
 
· Proceeding
SPAA '09 Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-606-9 doi>10.1145/1583991.1584071
Approximation algorithms for time-constrained scheduling on line networks Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 17
· Citation Count: 3


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 © 2012 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