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

Discrete Applied Mathematics

Volumn 157, Issue 17, 2009, Pages 3665-3677

  Kamiyama, Naoyuki ^a   Katoh, Naoki ^a   Takizawa, Atsushi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Dynamic network; Evacuation problem; Uniform path length

Indexed keywords

DIRECTED GRAPHS; DYNAMIC NETWORK; DYNAMIC NETWORK FLOW; EFFICIENT ALGORITHM; EVACUATION PROBLEM; EVACUATION PROBLEMS; GRID NETWORK; HIGH ORDER POLYNOMIAL; NETWORK PROBLEMS; POLYNOMIAL-TIME; RUNNING TIME; TRANSIT TIME; TRANSSHIPMENT PROBLEM; UNIFORM PATH-LENGTH;

GRAPH THEORY; POLYNOMIAL APPROXIMATION;

ALGORITHMS;

EID: 70350060332     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.04.007     Document Type: Article

References (16)

1. Hamacher H.W., and Tjandra S.A. Mathematical modelling of evacuation problem: State of the art. In: Schreckenberg M., and Sharma S.D. (Eds). Pedestrian and Evacuation Dynamics (2002), Springer 227-266
2. Ford L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton University Press
3. N. Kamiyama, N. Katoh, A. Takizawa, Theoretical and practical issues of evacuation planning in urban areas, in: Proc. the Eighth Hellenic European Research on Computer Mathematics and its Applications Conference, HERCMA2007, 2007, pp. 49-50
4. Hoppe B., and Tardos É. The quickest transshipment problem. Math. Oper. Res. 25 1 (2000) 36-62
5. Fleischer L., and Skutella M. Quickest flows over time. SIAM J. Comput. 36 6 (2007) 1600-1630
6. 2 n) algorithm for the optimal sink location problem in dynamic tree networks. Discrete Appl. Math. 154 16 (2006) 2387-2401
7. Hall A., Hippler S., and Skutella M. Multicommodity flows over time: Efficient algorithms and complexity. Theoret. Comput. Sci. 379 3 (2007) 387-404
8. Fleischer L., and Tardos É. Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23 3-5 (1998) 71-80
9. Kamiyama N., Katoh N., and Takizawa A. An efficient algorithm for evacuation problem in dynamic network flows with uniform arc capacity. IEICE Trans. Inform. Syst. E89-D 8 (2006) 2372-2379
10. Ibaraki T., and Katoh N. Resource allocation problems under submodular constraints. Resource Allocation Problems: Algorithmic Approaches (1988), MIT Press 144-176
11. Gallo G., Grigoriadis M.D., and Tarjan R.E. A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18 1 (1989) 30-55
12. Schrijver A. Combinatorial Optimization: Polyhedra and Efficiency (Algorithms and Combinatorics) (2003), Springer
13. Radzik T. Parametric flows, weighted means of cuts, and fractional combinatorial optimization. In: Pardalos P.M. (Ed). Complexity in Numerical Optimization (1993), World Scientific 351-386
14. Goldberg A.V., and Tarjan R.E. A new approach to the maximum-flow problem. J. ACM 35 4 (1988) 921-940
15. Pulleyblank W.R. Matchings and extensions. In: Graham R.L., Grötschel M., and Lovász L. (Eds). Handbook of Combinatorics vol. 1 (1995), MIT Press 179-233
16. N. Kamiyama, N. Katoh, A. Takizawa, Arc-disjoint in-trees in directed graphs, Combinatorica. Preliminary version has appeared in: Proc. of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA2008, 2008, pp. 518-526 (in press)