Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks
We address the problem of locating k sinks on dynamic flow path networks with n vertices in such a way that the evacuation completion time to them is minimized. Our two algorithms run in \(O(n\log n + k^2\log ^4 n)\) and \(O(n\log ^3 n)\) time, respectively. When all edges have the same capacity, we also present two algorithms which run in \(O(n + k^2\log ^2n)\) time and \(O(n\log n)\) time, respectively. These algorithms together improve upon the previously most efficient algorithms, which have time complexities \(O(kn\log ^2n)\)  and O(kn) , in the general and uniform edge capacity cases, respectively. The above results are achieved by organizing relevant data for subpaths in a strategic way during preprocessing, and the final results are obtained by extracting/merging them in an efficient manner.
Unable to display preview. Download preview PDF.
- 1.Arumugam, G.P., Augustine, J., Golin, M.J., Srikanthan, P.: A polynomial time algorithm for minimax-regret evacuation on a dynamic path (2014). arXiv:1404,5448v1
- 4.Cheng, S.-W., Higashikawa, Y., Katoh, N., Ni, G., Su, B., Xu, Y.: Minimax regret 1-sink location problems in dynamic path networks. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 121–132. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38236-9_12 CrossRefGoogle Scholar
- 6.Frederickson, G.N.: Optimal algorithms for tree partitioning. In: Proc. 2nd ACM-SIAM Symp. Discrete Algorithms, pp. 168–177 (1991)Google Scholar
- 8.Hamacher, H.W., Tjandra, S.A.: Mathematical modeling of evacuation problems: a state of the art. In: Pedestrian and Evacuation Dynamics, pp. 227–266. Springer Verlag (2002)Google Scholar
- 9.Higashikawa, Y.: Studies on the space exploration and the sink location under incomplete information towards applications to evacuation planning. PhD thesis, Kyoto University, Japan (2014)Google Scholar
- 11.Higashikawa, Y., Golin, M. J., Katoh, N.: Multiple sink location problems in dynamic path networks. Theoretical Computer Science 607, 2–15 (2015)Google Scholar
- 13.Kamiyama, N., Katoh, N., Takizawa, A.: An efficient algorithm for evacuation problem in dynamic network flows with uniform arc capacity. IEICE Transactions 89-D(8), 2372–2379 (2006)Google Scholar
- 14.Mamada, S., Makino, K., Fujishige, S.: Optimal sink location problem for dynamic flows in a tree network. IEICE Trans. Fundamentals E85-A, 1020–1025 (2002)Google Scholar
- 16.Megiddo, N.: Combinatorial optimization with rational objective functions. Math. Oper. Res. 4, 414–424 (1979)Google Scholar
- 18.Skutella, M.: An introduction to network flows over time. In: Research Trends in Combinatorial Optimization, pp. 451–482. Springer (2009)Google Scholar