A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths.

Naoyuki Kamiyama, Naoki Katoh

Browse the full ISAAC paper archive.