An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths

Authors:
Naoyuki Kamiyama;Naoki Katoh;Atsushi Takizawa
Affiliations:
Department of Architecture and Architectural Engineering,Kyoto University, Kyotodaigaku-Katsura, Nishikyo-ku, Kyoto, 615-8540, Japan;Department of Architecture and Architectural Engineering,Kyoto University, Kyotodaigaku-Katsura, Nishikyo-ku, Kyoto, 615-8540, Japan;Department of Architecture and Architectural Engineering,Kyoto University, Kyotodaigaku-Katsura, Nishikyo-ku, Kyoto, 615-8540, Japan
Venue:
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Year:
2007

Citing 6
Cited 1

Resource allocation problems: algorithmic approaches

Resource allocation problems: algorithmic approaches
A fast parametric maximum flow algorithm and applications

SIAM Journal on Computing
The Quickest Transshipment Problem

Mathematics of Operations Research
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

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management

Arc-disjoint in-trees in directed graphs

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the evacuation problem for 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 [1] 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 dynamic network with a single sink ssuch that (i) for each vertex vthe sum of transit times of arcs on any path from vto stakes the same value, and (ii) for each vertex vthe minimum v-scut is determined by the arcs incident to swhose tails are reachable from v. We propose an efficient algorithm for this network problem. This class of networks is a generalization of the grid network studied in the paper [2].