A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A fast parametric maximum flow algorithm and applications
SIAM Journal on Computing
Handbook of combinatorics (vol. 1)
The Quickest Transshipment Problem
Mathematics of Operations Research
An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity
IEICE - Transactions on Information and Systems
An O(n log2 n) algorithm for the optimal sink location problem in dynamic tree networks
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Multicommodity flows over time: Efficient algorithms and complexity
Theoretical Computer Science
SIAM Journal on Computing
Arc-disjoint in-trees in directed graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient continuous-time dynamic network flow algorithms
Operations Research Letters
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Robustness of minimum cost arborescences
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
The root location problem for arc-disjoint arborescences
Discrete Applied Mathematics
| Hi-index | 0.04 |
In this paper, we consider the evacuation problem in a network which consists of a directed graph with capacities and transit times on its arcs. This problem can be solved by the algorithm of Hoppe and Tardos [B. Hoppe, E. Tardos, The quickest transshipment problem, Math. Oper. Res. 25(1) (2000) 36-62] in polynomial time. However their running time is high-order polynomial, and hence is not practical in general. Thus, it is necessary to devise a faster algorithm for a tractable and practically useful subclass of this problem. In this paper, we consider a network with a sink s such that (i) for each vertex vs the sum of the transit times of arcs on any path from v to s takes the same value, and (ii) for each vertex vs the minimum v-s cut is determined by the arcs incident to s whose tails are reachable from v. This class of networks is a generalization of grid networks studied in the paper [N. Kamiyama, N. Katoh, A. Takizawa, An efficient algorithm for evacuation problem in dynamic network flows with uniform arc capacity, IEICE Trans. Infrom. Syst. E89-D (8) (2006) 2372-2379]. We propose an efficient algorithm for this network problem.