Imagine you are using the European transportation network and looking for the fastest and cheapest route to move as many goods as possible from Copenhagen to Milan. Kyng's algorithm can be applied ...

Kyng's algorithm can be applied in such cases to calculate the optimal, lowest-cost traffic flow for any kind of network—be it rail, road, water or the internet.

This algorithm solves the minimum-cost maximum-flow problem for networks that incrementally change as new connections are added. Furthermore, in a second paper accepted by the IEEE Symposium on ...