The problem has many applications: internet data flow ... the algorithm’s publication, researchers tried to speed up the runtime by having the algorithm make more judicious choices — such as always ...

Shortest-paths problems are a special case of minimum-cost flow, so the new minimum-cost-flow algorithm could also be used to solve the negative-weight shortest-paths problem in near-linear time, ...