Shortest path and maximum flow problems in networks with additive losses and gains

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]

Authors

Franz-Josef Brandenburg

This author has not been identified. Look up 'Franz-Josef Brandenburg' in Google

Mao-cheng Cai

This author has not been identified. Look up 'Mao-cheng Cai' in Google