The Two-Processor Scheduling Problem is in Random NC
| dc.contributor.author | Vazirani, Umesh V. | en_US |
| dc.contributor.author | Vazirani, Vijay V. | en_US |
| dc.date.accessioned | 2007-04-23T17:36:00Z | |
| dc.date.available | 2007-04-23T17:36:00Z | |
| dc.date.issued | 1989-05 | en_US |
| dc.description.abstract | An efficient parallel algorithm $(RNC^{2})$ for the two-processor scheduling problem is presented. An interesting feature of this algorithm is that it finds a highest level first schedule: such a schedule defines a lexicographically first solution to this problem in a natural way. A key ingredient of the algorithm is a generalization of a theorem of Tutte which establishes a one-to-one correspondence between the bases of the Tutte matrix of a graph and the sets of matches nodes in maximum matchings in the graph. | en_US |
| dc.format.extent | 1233340 bytes | |
| dc.format.extent | 291708 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1000 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6800 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | The Two-Processor Scheduling Problem is in Random NC | en_US |
| dc.type | technical report | en_US |