An O (n log2 n) algorithm for the optimal sink location problem in dynamic tree networks

Discrete Applied Mathematics

Volumn 154, Issue 16, 2006, Pages 2387-2401

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

^a OSAKA UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^c UNIVERSITY OF TOKYO   (Japan)

^d KYOTO UNIVERSITY   (Japan)

Author keywords

Dynamic flows; Location problem; Tree networks

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DYNAMIC PROGRAMMING; GRAPH THEORY; PROBLEM SOLVING;

DYNAMIC FLOWS; LOCATION PROBLEM; TREE NETWORKS;

ALGORITHMS;

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

References (16)

1. Arata K., Iwata S., Makino K., and Fujishige S. Locating sources to meet flow demands in undirected networks. J. Algorithms 42 (2002) 54-68
2. Aronson J.E. A survey of dynamic network flows. Ann. Oper. Res. 20 (1989) 1-66
3. Ford Jr. L.R., and Fulkerson D.R. Constructing maximal dynamic flows from static flows. Oper. Res. 6 (1958) 419-433
4. Ford Jr. L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton University Press, Princeton, NJ
5. Hamacher H.W., and Tjandra S.A. Mathematical modelling of evacuation problems: a state of the art. Pedestrian and Evacuation Dynamics (2002), Springer, Berlin 227-266
6. Hoppe B., and Tardos E. The quickest transshipment problem. Math. Oper. Res. 25 (2000) 36-62
7. Ito H., Uehara H., and Yokoyama M. A faster and flexible algorithm for a location problem on undirected flow networks. IEICE Trans. Fundamentals E83-A (2000) 704-712
8. Iwata S., Fleischer L., and Fujishige S. A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48 (2001) 761-777
9. Mamada S., Makino K., and Fujishige S. Optimal sink location problem for dynamic flows in a tree network. IEICE Trans. Fundamentals E85-A (2002) 1020-1025
10. 2 n) algorithm for a sink location problem in dynamic tree networks. Proceedings of International Conference on Theoretical Computer Science (TCS2004). Kluwer, Dordrecht (2004) 251-264
11. S. Mamada, T. Uno, K. Makino, S. Fujishige, A tree partioning problem arising from an evacuation problem in tree dynamic networks, J. Oper. Res. Soc. Jpn 48 (2005) 196-206.
12. Mirchandani P.B., and Francis R.L. Discrete Location Theory (1989), Wiley, New York
13. W.B. Powell, P. Jaillet, A. Odoni: Stochastic and dynamic networks and routing, in: M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.), Network Routing, Handbooks in Operations Research and Management Science, vol. 8, North-Holland, Amsterdam, The Netherlands, 1995, Chapter 3, pp. 141-295
14. Schrijver A. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combin. Theory B 80 (2000) 346-355
15. Tamura H., Sengoku M., Shinoda S., and Abe T. Some covering problems in location theory on flow networks. IEICE Trans. Fundamentals E75-A (1992) 678-683
16. Tamura H., Sugawara H., Sengoku M., and Shinoda S. Plural cover problem on undirected flow networks. IEICE Trans. Fundamentals J81-A (1998) 863-869 (in Japanese)