Approximating the minimum-cost maximum flow is P-complete
From MaRDI portal
Publication:1198087
DOI10.1016/0020-0190(92)90229-OzbMath0772.68056OpenAlexW1969990079MaRDI QIDQ1198087
Publication date: 16 January 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90229-o
Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)
Cites Work