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

Authors:
Naoyuki Kamiyama;Naoki Katoh
Affiliations:
Department of Information and System Engineering, Chuo University,;Department of Architecture and Architectural Engineering, Kyoto University,
Venue:
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Year:
2009

Citing 6
Cited 0

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Faster Algorithms for the Quickest Transshipment Problem

SIAM Journal on Optimization
Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple Sources

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Multicommodity flows over time: Efficient algorithms and complexity

Theoretical Computer Science
Quickest Flows Over Time

SIAM Journal on Computing
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the universally quickest transshipment problem in a dynamic network where each arc has not only a capacity but also a transit time. The problem asks for minimizing the time when the last supply reaches the sink as well as simultaneously maximizing the amount of supply which has reached the sink at every time step. In this paper, we propose a polynomial-time algorithm for the problem in the class of dynamic networks which is a generalization of grid networks with uniform capacity and uniform transit time.