An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths

DOI10.1016/j.dam.2009.04.007zbMath1228.90018OpenAlexW2029812534MaRDI QIDQ967437

Naoyuki Kamiyama, Atsushi Takizawa, Naoki Katoh

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2433/123378

zbMATH Keywords

dynamic networkevacuation problemuniform path-length

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (4)

Robustness of minimum cost arborescences ⋮ Dynamic graph generation for the shortest path problem in time expanded networks ⋮ The root location problem for arc-disjoint arborescences ⋮ The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths

Cites Work

• An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
• Efficient continuous-time dynamic network flow algorithms
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Multicommodity flows over time: Efficient algorithms and complexity
• The Quickest Transshipment Problem
• A new approach to the maximum-flow problem
• A Fast Parametric Maximum Flow Algorithm and Applications
• Quickest Flows Over Time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths