O(n log2 n) an algorithm for a sink location problem in dynamic tree networks

IFIP Advances in Information and Communication Technology

Volumn 155, Issue , 2004, Pages 251-264

  Mamada, Satoko ^a   Uno, Takeaki ^b   Makino, Kazuhisa ^a   Fujishige, Satoru ^c  

^a OSAKA UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^c KYOTO UNIVERSITY   (Japan)

Author keywords

Dynamic flows; Location problem; Tree networks

Indexed keywords

FORESTRY; LOCATION;

DYNAMIC FLOWS; DYNAMIC NETWORK; LOCATION PROBLEMS; SINK LOCATIONS; TIME ALGORITHMS; TRANSSHIPMENT PROBLEM; TREE NETWORK; TREE STRUCTURES;

TREES (MATHEMATICS);

EID: 84901022603     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/1-4020-8141-3_21     Document Type: Conference Paper

References (16)

1. K. Arata, S. Iwata, K. Makino and S. Fujishige: Locating sources to meet flow demands in undirected networks, Journal of Algorithms, 42 (2002) 54-68.
2. J. E. Aronson: A survey of dynamic network flows, Annals of OR, 20 (1989) 1-66.
3. L. G. Chalmet, R. L. Francis and P. B. Saunders: Network models for building evacuation. Management Science, 28 (1982) 86-105.
4. L. Fleischer and E. Tardos: Efficient continuous-time dynamic network flow algorithms, Operations Research Letters, 23 (1998) 71-80.
5. L. R. Ford, Jr. and D. R. Fulkerson: Constructing maximal dynamic flows from static flows, Op. Res.,6 (1958) 419-433.
6. L. R. Ford, Jr. and D. R. Fulkerson: Flows in Networks, (Princeton University Press, Princeton, NJ, 1962).
7. H. W. Hamacher and S.A. Tjandra: Mathematical modelling of evacuation problems: A state of the art, In: Pedestrian and Evacuation Dynamics, Springer, (2002) 227-266.
8. B. Hoppe and É. Tardos: The quickest transshipment problem, Mathematics of Operations Research, 25 (2000) 36-62.
9. S. Iwata, L. Fleischer, and S. Fujishige: A combinatorial strongly polynomial algorithm for minimizing submodular functions, Journal of the ACM, 48 (2001) 761-777.
10. H. Ito, H. Uehara and M. Yokoyama: A faster and flexible algorithm for a location problem on undirected flow networks, IEICE Trans. Fundamentals, E83-A (2000) 704-712.
11. S. Mamada, K. Makino and S. Fujishige: Optimal sink location problem for dynamic flows in a tree network, IEICE Trans. Fundamentals, E85-A (2002) 1020-1025.
12. S. Mamada, T, Uno, K. Makino, and S. Fujishige: An evacuation problem in tree dynamic networks with multiple exits, Working paper.
13. P. B. Mirchandani and R. L. Francis: Discrete Location Theory, (John Wile & Sons, Inc., 1989).
14. W. B. Powell, P. Jaillet, and A. Odoni: Stochastic and dynamic networks and routing, In: Network Routing, Handbooks in Operations Research and Management Science 8 (M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, eds, North-Holland, Amsterdam, The Netherlands, 1995), Chapter 3,141-295.
15. A. Schrijver: A combinatorial algorithm minimizing submodular functions in strongly polynomial time, J. Combinatorial Theory, B80 (2000) 346-355.
16. H. Tamura, M. Sengoku, S. Shinoda, and T. Abe: Some covering problems in location theory on flow networks, IEICE Trans. Fundamentals, E75-A (1992) 678-683.