Approximating the Minimum-cost Maximum Flow is P-Complete

Author(s)
Stein, Clifford; Wein, Joel
Thumbnail
DownloadMIT-LCS-TM-472.pdf (1.918Mb)
Metadata
Show full item record
Abstract
We show that it is impossible, in NC, to approximate the value of the minimum-cost maximum flow unless P = NC.
Date issued
1992-06
URI
https://hdl.handle.net/1721.1/149197
Series/Report no.
MIT-LCS-TM-472
Collections