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

Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa

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

5 Citations (Scopus)

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 log n) 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.

Original languageEnglish
Title of host publicationAlgorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings
PublisherSpringer Verlag
Pages231-242
Number of pages12
ISBN (Print)3540351574, 9783540351573
DOIs
Publication statusPublished - Jan 1 2006
Externally publishedYes
Event2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006 - Hong Kong, China
Duration: Jun 20 2006Jun 22 2006

Publication series

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

Other

Other2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006
CountryChina
CityHong Kong
Period6/20/066/22/06

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity'. Together they form a unique fingerprint.

Cite this