Complexity results and algorithms for {<,≤,=}-constrained scheduling

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Bonnie Berger Laboratory for Computer Science and Department of Applied Mathematics, Massachusetts Institute of Technology, Cambridge, MA
Lenore Cowen Laboratory for Computer Science and Department of Applied Mathematics, Massachusetts Institute of Technology, Cambridge, MA
Published in:
· Proceeding
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Pages 137-147
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1991
table of contents ISBN:0-89791-376-0
Complexity results and algorithms for {<,≤,=}-constrained scheduling 1991 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 14
· Downloads (cumulative): 194
· Citation Count: 0


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