Approximating the Minimum-cost Maximum Flow is P-Complete
| dc.contributor.author | Stein, Clifford | en_US |
| dc.contributor.author | Wein, Joel | en_US |
| dc.date.accessioned | 2023-03-29T14:36:18Z | |
| dc.date.available | 2023-03-29T14:36:18Z | |
| dc.date.issued | 1992-06 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149197 | |
| dc.description.abstract | We show that it is impossible, in NC, to approximate the value of the minimum-cost maximum flow unless P = NC. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-472 | |
| dc.title | Approximating the Minimum-cost Maximum Flow is P-Complete | en_US |
| dc.identifier.oclc | 26912015 |
