Franz-Josef Brandenburg, Mao-cheng Cai. Shortest path and maximum flow problems in networks with additive losses and gains. Theoretical Computer Science, 412(4-5):391-401, 2011. [doi]
@article{BrandenburgC11,
title = {Shortest path and maximum flow problems in networks with additive losses and gains},
author = {Franz-Josef Brandenburg and Mao-cheng Cai},
year = {2011},
doi = {10.1016/j.tcs.2010.11.019},
url = {http://dx.doi.org/10.1016/j.tcs.2010.11.019},
tags = {data-flow},
researchr = {https://researchr.org/publication/BrandenburgC11},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {412},
number = {4-5},
pages = {391-401},
}