Abstract
In this paper, we consider a sink location in a dynamic network which consists of a graph with capacities and transit times on its arcs. Given a dynamic network with initial supplies at vertices, the problem is to find a vertex υ as a sink in the network such that we can send all the initial supplies to υ as quickly as possible. We present an O(n log 2 n) time algorithm for the sink location problem in a dynamic network of tree structure, where n is the number of vertices in the network. This improves upon the existing O(n 2)-time bound. As a corollary, we also show that the quickest transshipment problem can be solved in O(n log 2 n) time if a given network is a tree and has a single sink. Our results are based on data structures for representing tables (i.e., set of intervals with their height), which may be of independent interest.
Chapter PDF
Similar content being viewed by others
References
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.
J. E. Aronson: A survey of dynamic network flows, Annals of OR 20 (1989) 1–66.
L. G. Chalmet, R. L. Francis and P. B. Saunders: Network models for building evacuation. Management Science, 28 (1982) 86–105.
L. Fleischer and E. Tardos: Efficient continuous-time dynamic network flow algorithms. Operations Research Letters, 23 (1998) 71–80.
L. R. Ford, Jr. and D. R. Fulkerson: Constructing maximal dynamic flows from static flows, Op. Res., 6 (1958) 419–433.
L. R. Ford Jr., and D. R. Fulkerson: Flows in Network (Princeton University Press, Princeton, NJ, 1962).
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
B. Hoppe and É. Tardos: The quickest transshipment problems, Mathematics of Operations Research, 25 (2000) 36–62.
S. Iwata, L. Fleischer, and S. Fujishige: A combinatorial strongly polynomial algorithm for minimizing submodular functions, Journal of the ACM 48 (2001) 761–777.
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.
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.
S. Mamada, K. Makino, and S. Fujishige: An evacuation problem in tree dynamic networks with multiple exits, Working paper.
P. B. Mirchandani and R. L. Francis: Discrete Location Theory (John Wile & Sons Inc., 1989).
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.
A. Schrijver: A combinatorial algorithm minimizing submodular functions in strongly polynomial time, J. Combinatorial Theory, B80 (2000) 346–355.
H. Tamura, M. Sengoku, S. Shinoda, and T. Abe: Some covering problems in location theory on flow networks, IEICE Trans. E75-A (1992) 678–683.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science + Business Media, Inc.
About this paper
Cite this paper
Mamada, S., Uno, T., Makino, K., Fujishige, S. (2004). An O(n log2 n) Algorithm for a Sink Location Problem in Dynamic Tree Networks. In: Levy, JJ., Mayr, E.W., Mitchell, J.C. (eds) Exploring New Frontiers of Theoretical Informatics. IFIP International Federation for Information Processing, vol 155. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8141-3_21
Download citation
DOI: https://doi.org/10.1007/1-4020-8141-3_21
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-8140-8
Online ISBN: 978-1-4020-8141-5
eBook Packages: Springer Book Archive