A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths

Naoyuki Kamiyama, Naoki Katoh

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

Abstract

In this paper, we consider the universally quickest transshipment problem in a dynamic network where each arc has not only a capacity but also a transit time. The problem asks for minimizing the time when the last supply reaches the sink as well as simultaneously maximizing the amount of supply which has reached the sink at every time step. In this paper, we propose a polynomial-time algorithm for the problem in the class of dynamic networks which is a generalization of grid networks with uniform capacity and uniform transit time.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings
Pages802-811
Number of pages10
DOIs
Publication statusPublished - Dec 1 2009
Event20th International Symposium on Algorithms and Computation, ISAAC 2009 - Honolulu, HI, United States
Duration: Dec 16 2009Dec 18 2009

Publication series

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

Other

Other20th International Symposium on Algorithms and Computation, ISAAC 2009
CountryUnited States
CityHonolulu, HI
Period12/16/0912/18/09

Fingerprint

Dynamic Networks
Path Length
Polynomial-time Algorithm
Polynomials
Arc of a curve
Grid
Class

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kamiyama, N., & Katoh, N. (2009). A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. In Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings (pp. 802-811). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5878 LNCS). https://doi.org/10.1007/978-3-642-10631-6_81

A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. / Kamiyama, Naoyuki; Katoh, Naoki.

Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings. 2009. p. 802-811 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5878 LNCS).

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

Kamiyama, N & Katoh, N 2009, A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. in Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5878 LNCS, pp. 802-811, 20th International Symposium on Algorithms and Computation, ISAAC 2009, Honolulu, HI, United States, 12/16/09. https://doi.org/10.1007/978-3-642-10631-6_81
Kamiyama N, Katoh N. A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. In Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings. 2009. p. 802-811. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-10631-6_81
Kamiyama, Naoyuki ; Katoh, Naoki. / A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings. 2009. pp. 802-811 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{24bae1d1c9a44f79bf6efe71448357ae,
title = "A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths",
abstract = "In this paper, we consider the universally quickest transshipment problem in a dynamic network where each arc has not only a capacity but also a transit time. The problem asks for minimizing the time when the last supply reaches the sink as well as simultaneously maximizing the amount of supply which has reached the sink at every time step. In this paper, we propose a polynomial-time algorithm for the problem in the class of dynamic networks which is a generalization of grid networks with uniform capacity and uniform transit time.",
author = "Naoyuki Kamiyama and Naoki Katoh",
year = "2009",
month = "12",
day = "1",
doi = "10.1007/978-3-642-10631-6_81",
language = "English",
isbn = "3642106307",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "802--811",
booktitle = "Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings",

}

TY - GEN

T1 - A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths

AU - Kamiyama, Naoyuki

AU - Katoh, Naoki

PY - 2009/12/1

Y1 - 2009/12/1

N2 - In this paper, we consider the universally quickest transshipment problem in a dynamic network where each arc has not only a capacity but also a transit time. The problem asks for minimizing the time when the last supply reaches the sink as well as simultaneously maximizing the amount of supply which has reached the sink at every time step. In this paper, we propose a polynomial-time algorithm for the problem in the class of dynamic networks which is a generalization of grid networks with uniform capacity and uniform transit time.

AB - In this paper, we consider the universally quickest transshipment problem in a dynamic network where each arc has not only a capacity but also a transit time. The problem asks for minimizing the time when the last supply reaches the sink as well as simultaneously maximizing the amount of supply which has reached the sink at every time step. In this paper, we propose a polynomial-time algorithm for the problem in the class of dynamic networks which is a generalization of grid networks with uniform capacity and uniform transit time.

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

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

U2 - 10.1007/978-3-642-10631-6_81

DO - 10.1007/978-3-642-10631-6_81

M3 - Conference contribution

AN - SCOPUS:75649128725

SN - 3642106307

SN - 9783642106309

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

SP - 802

EP - 811

BT - Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings

ER -