An efficient algorithm for the evacuation problem in a certain class of a network with uniform path-lengths

Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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 s such that (i) for each vertex v the sum of transit times of arcs on any path from v to s takes the same value, and (ii) for each vertex v the minimum v-s cut is determined by the arcs incident to s whose 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].

Original languageEnglish
Title of host publicationAlgorithmic Aspects in Information and Management - Third International Conference, AAIM 2007, Proceedings
Pages178-190
Number of pages13
Publication statusPublished - Dec 1 2007
Externally publishedYes
Event3rd International Conference on Algorithmic Aspects in Information and Management, AAIM 2007 - Portland, OR, United States
Duration: Jun 6 2007Jun 8 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4508 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Conference on Algorithmic Aspects in Information and Management, AAIM 2007
Country/TerritoryUnited States
CityPortland, OR
Period6/6/076/8/07

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'An efficient algorithm for the evacuation problem in a certain class of a network with uniform path-lengths'. Together they form a unique fingerprint.

Cite this