Naoyuki Kamiyama, Naoki Katoh. A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths. In Yingfei Dong, Ding-Zhu Du, Oscar H. Ibarra, editors, Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings. Volume 5878 of Lecture Notes in Computer Science, pages 802-811, Springer, 2009. [doi]
Abstract is missing.