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

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

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.

本文言語英語
ホスト出版物のタイトルAlgorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings
ページ802-811
ページ数10
DOI
出版ステータス出版済み - 12 1 2009
外部発表はい
イベント20th International Symposium on Algorithms and Computation, ISAAC 2009 - Honolulu, HI, 米国
継続期間: 12 16 200912 18 2009

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5878 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他20th International Symposium on Algorithms and Computation, ISAAC 2009
国/地域米国
CityHonolulu, HI
Period12/16/0912/18/09

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル