Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Naoyuki Kamiyama, Naoki Katoh. The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. Discrete Applied Mathematics, 178:89-100, 2014. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-LengthsNaoyuki Kamiyama, Naoki Katoh. isaac 2009: 802-811 [doi] An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-LengthsNaoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa. AAIM 2007: 178-190 [doi] An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengthsNaoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa. DAM, 157(17):3665-3677, 2009. [doi]
The following publications are possibly variants of this publication: