Clifford Stein, Joel Wein. Approximating the Minimum-Cost Maximum Flow is P-Complete. Inf. Process. Lett., 42(6):315-319, 1992.
@article{SteinW92:0,
title = {Approximating the Minimum-Cost Maximum Flow is P-Complete},
author = {Clifford Stein and Joel Wein},
year = {1992},
tags = {completeness, data-flow},
researchr = {https://researchr.org/publication/SteinW92%3A0},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {42},
number = {6},
pages = {315-319},
}