Accessibility notice: If you need help accessing this archived item, Ask a Librarian.
NP-Completeness of Linearly-Connected Multiprocessor Scheduling

File(s)
Date
1987Author
Verghese, Gilbert
Dyer, Charles R
Publisher
University of Wisconsin-Madison Department of Computer Sciences
Metadata
Show full item recordPermanent Link
http://digital.library.wisc.edu/1793/58854Type
Technical Report
Citation
TR709
