Some Related Problems from Network Flows, Game Theory and Integer Programming
| dc.contributor.author | Sahni, Sartaj | en_US |
| dc.date.accessioned | 2007-04-19T18:14:41Z | |
| dc.date.available | 2007-04-19T18:14:41Z | |
| dc.date.issued | 1972-07 | en_US |
| dc.description.abstract | We consider several important problems for which no polynomially time bounded algorithm is known. These problems are shown to be related in that a polynomial algorithm for one implies a polynomial algorrithm for the others. | en_US |
| dc.format.extent | 1509233 bytes | |
| dc.format.extent | 426907 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/TR72-132 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/5987 | |
| 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 | Some Related Problems from Network Flows, Game Theory and Integer Programming | en_US |
| dc.type | technical report | en_US |