[1] HIGASHIKAWA Y, GOLIN M J, KATOH N. Multiple sink location problems in dynamic path networks[C]//International Conference on Algorithmic Aspects of Information and Management, July 8-11, 2014, Vancouver, BC, Canada. Cham: Springer, 2014: 149-161. [2] HIGASHIKAWA Y, GOLIN M J, KATOH N. Multiple sink location problems in dynamic path networks[J]. Theoretical Computer Science, 2015, 607(1): 2-15. [3] 倪冠群,徐寅峰,徐玖平.考虑道路通行能力的应急避难点选址模型及算法[J].中国管理科学,2015,23(1):82-88. [4] 赵容,刘克艳,任佩瑜.路段通行能力不同的避难点选址模型及算法[J].中国管理科学,2017,25(9):133-140. [5] BHATTACHARYA B, GOLIN M J, HIGASHIKAWA Y, et al. Improved algorithms for computing k-sink ondynamic flow path networks[C]//Algorithms and Data Structures Symposium, July 31-August 2,2017, St. John’s, NL, Canada. Cham: Springer, 2017: 133-144. [6] BENKOCZI R, BHATTACHARYA B, HIGASHIKAWA Y, et al. Minsum k-sink problem on dynamic flow path networks[C]//International Workshop on Combinatorial Algorithms, July 16-19,2018, Singapore. Cham: Springer, 2018: 78-89. [7] BENKOCZI R, BHATTACHARYA B, HIGASHIKAWA Y, et al. Minsum k-sink problem on path networks[J]. Theoretical Computer Science, 2020, 806(2): 388-401. [8] MAMADA S, UNO T, MAKINO K, et al. An O(n log2n) algorithm for the optimal sink location problem in a dynamic flow tree network[J]. Discrete Applied Mathematics, 2006, 154(16): 2387-2401. [9] HIGASHIKAWA Y, GOLIN M J, KATOH N. Minimax regret sink location problem in a dynamic flow treenetwork with uniform capacity[J]. Journal of Graph Algorithms and Applications, 2014, 18(4): 539-555. [10] CHEN D, GOLIN M. Sink evacuation on trees with dynamic confluent flows[C]//International Symposium on Algorithms and Computation, December 12-14,2016, Sydney, Australia. Dagstuhl: Schloss Dagstuhl-Leibniz Zentrum fuer Informatik, 2016: 1-13. [11] CHEN D, GOLIN M. Minmax centered k-partitioning of trees and applications to sink evacuation with dynamic confluent flows[J]. Algorithmica, 2023, 85(7): 1948-2000. [12] BENKOCZI R, BHATTACHARYA B, ĆUSTIC A, et al. Facility location problems in cycle networks[C]// Japan Conference on Discrete and Computational Geometry, Graphs, and Games, August 29-September 1,2017, Tokyo University of Science, Tokyo, Japan. Cham: Springer, 2017: 139-140. [13] XU Y F, LI H M. Minimax regret 1-sink location problem in dynamic cycle networks[J]. Information Processing Letters, 2015, 115(2): 163-169. [14] BENKOCZI R, BHATTACHARYA B, HIGASHIKAWA Y, et al. Minmax-regret evacuation planning for cycle networks[C]//Annual Conference on Theory and Applications of Models of Computation, April 13-16, 2019, Kitakyushu, Japan. Cham: Springer, 2019: 42-58. |