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

Fingerprint

Evacuation
Network Flow
Directed graphs
Dynamic Networks
Arc of a curve
Efficient Algorithms
Directed Graph
Grid

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kamiyama, N., Katoh, N., & Takizawa, A. (2006). An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity. In Algorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings (pp. 231-242). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4041 LNCS). Springer Verlag. https://doi.org/10.1007/11775096_22

An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity. / Kamiyama, Naoyuki; Katoh, Naoki; Takizawa, Atsushi.

Algorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings. Springer Verlag, 2006. p. 231-242 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4041 LNCS).

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

Kamiyama, N, Katoh, N & Takizawa, A 2006, An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity. in Algorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4041 LNCS, Springer Verlag, pp. 231-242, 2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006, Hong Kong, China, 6/20/06. https://doi.org/10.1007/11775096_22
Kamiyama N, Katoh N, Takizawa A. An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity. In Algorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings. Springer Verlag. 2006. p. 231-242. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11775096_22
Kamiyama, Naoyuki ; Katoh, Naoki ; Takizawa, Atsushi. / An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity. Algorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings. Springer Verlag, 2006. pp. 231-242 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{f2f8609f73a14bb0b13ceee53921389c,
title = "An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity",
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.",
author = "Naoyuki Kamiyama and Naoki Katoh and Atsushi Takizawa",
year = "2006",
month = "1",
day = "1",
doi = "10.1007/11775096_22",
language = "English",
isbn = "3540351574",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "231--242",
booktitle = "Algorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings",
address = "Germany",

}

TY - GEN

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

AU - Kamiyama, Naoyuki

AU - Katoh, Naoki

AU - Takizawa, Atsushi

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33746257211&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746257211&partnerID=8YFLogxK

U2 - 10.1007/11775096_22

DO - 10.1007/11775096_22

M3 - Conference contribution

AN - SCOPUS:33746257211

SN - 3540351574

SN - 9783540351573

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 231

EP - 242

BT - Algorithmic Aspects in Information and Management - Second International Conference, AAIM 2006, Proceedings

PB - Springer Verlag

ER -