An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity

  • Naoyuki Kamiyama
  • Naoki Katoh
  • Atsushi Takizawa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4041)


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 logn) 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.


Time Algorithm Resource Allocation Problem Tree Network Network Constraint Grid Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hoppes, B., Tardos, É.: The quickest transshipment problem. Mathematics of Operations Research 25, 36–62 (2000)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Mamada, S., Uno, T., Makino, K., Fujishige, S.: An O(nlog 2 n) algorithm for a sink location problem in dynamic tree networks. Discrete Applied Mathematics (to appear)Google Scholar
  3. 3.
    Mamada, S., Makino, K., Fujishige, S.: Evacuation problems and dynamic network flows. In: Proc. SICE Annual Conference 2004, pp. 530–535 (2004)Google Scholar
  4. 4.
    Mamada, S., Uno, T., Makino, K., Fujishige, S.: A tree partitioning problem arising from an evacuation problem in tree dynamic networks. Journal of the Operations Research Society of Japan 48, 196–206 (2005)MATHMathSciNetGoogle Scholar
  5. 5.
    Ibaraki, T., Katoh, N.: Resource allocation problems under submodular constraints. In: Resource Allocation Problems: Algorithmic Approaches, pp. 144–176. MIT Press, Cambridge (1988)Google Scholar
  6. 6.
    Fujishige, S.: Nonlinear optimization with submodular constraints. In: Submodular Functions and Optimization, 2nd edn., pp. 223–250. Elsevier Science Ltd, North-Holland (2005)Google Scholar
  7. 7.
    Fujishige, S.: Lexicographically optimal base of a polymatroid with respect to a weight vector. Mathematics of Operations Research 5, 186–196 (1980)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Mamada, S., Makino, K., Fujishige, S.: Optimal sink location problem for dynamic flows in a tree network. IEICE Transactions on Fundamentals E85-A, 1020–1025 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Naoyuki Kamiyama
    • 1
  • Naoki Katoh
    • 1
  • Atsushi Takizawa
    • 1
  1. 1.Department of Architecture and Architectural EngineeringKyoto UniversityKyotoJapan

Personalised recommendations