An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity

Authors:
Naoyuki Kamiyama;Naoki Katoh;Atsushi Takizawa
Affiliations:
Department of Architecture and Architectural Engineering, Kyoto University, Kyoto, Japan;Department of Architecture and Architectural Engineering, Kyoto University, Kyoto, Japan;Department of Architecture and Architectural Engineering, Kyoto University, Kyoto, Japan
Venue:
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Year:
2006

Citing 3
Cited 1

Resource allocation problems: algorithmic approaches

Resource allocation problems: algorithmic approaches
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

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

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the quickest flow problem in a network which consists of a directed graph with capacities and transit times on its arcs. We present an O(n logn) time algorithm for the quickest flow problem in a network of grid structure with uniform arc capacity which has a single sink where n is the number of vertices in the network.