NP-Completeness of Linearly-Connected Multiprocessor Scheduling

Simple item page
dc.contributor.authorVerghese, Gilberten_US
dc.contributor.authorDyer, Charles Ren_US
dc.date.accessioned2012-03-15T16:44:44Z
dc.date.available2012-03-15T16:44:44Z
dc.date.created1987en_US
dc.date.issued1987
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR709en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/58854
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleNP-Completeness of Linearly-Connected Multiprocessor Schedulingen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR709.pdf
Size:
1.84 MB
Format:
Adobe Portable Document Format
Download

Collections

CS Technical Reports