Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

  • Yuya Higashikawa
  • Mordecai J. Golin
  • Naoki Katoh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8344)


This paper addresses the minimax regret sink location problem in dynamic tree networks. In our model, a dynamic tree network consists of an undirected tree with positive edge lengths and uniform edge capacity, and the vertex supply which is nonnegative value is unknown but only the interval of supply is known. A particular realization of supply to each vertex is called a scenario. Under any scenario, the cost of a sink location x is defined as the minimum time to complete the evacuation to x for all supplies (evacuees), and the regret of x is defined as the cost of x minus the cost of the optimal sink location. Then, the problem is to find a sink location minimizing the maximum regret for all possible scenarios. We present an O(n 2 log2 n) time algorithm for the minimax regret sink location problem in dynamic tree networks with uniform capacity, where n is the number of vertices in the network. As a preliminary step for this result, we also address the minimum cost sink location problem in a dynamic tree networks under a fixed scenario and present an O(n logn) time algorithm, which improves upon the existing time bound of O(n log2 n) by [11] if edges of a tree have uniform capacity.


minimax regret sink location dynamic flow evacuation planning 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Averbakh, I., Berman, O.: Algorithms for the robust 1-center problem on a tree. European Journal of Operational Research 123(2), 292–302 (2000)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Bhattacharya, B., Kameda, T.: A linear time algorithm for computing minmax regret 1-median on a tree. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 1–12. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  3. 3.
    Brodal, G.S., Georgiadis, L., Katriel, I.: An O(n logn) version of the Averbakh-Berman algorithm for the robust median of a tree. Operations Research Letters 36(1), 14–18 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Chen, B., Lin, C.: Minmax-regret robust 1-median location on a tree. Networks 31(2), 93–103 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Conde, E.: Minmax regret location-allocation problem on a network under uncertainty. European Journal of Operational Research 179(3), 1025–1039 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Conde, E.: A note on the minmax regret centdian location on trees. Operations Research Letters 36(2), 271–275 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Ford Jr., L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations Research 6, 419–433 (1958)CrossRefMathSciNetGoogle Scholar
  9. 9.
    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
  10. 10.
    Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publishers, Dordrecht (1997)CrossRefzbMATHGoogle Scholar
  11. 11.
    Mamada, S., Uno, T., Makino, K., Fujishige, S.: An O(n log2 n) algorithm for the optimal sink location problem in dynamic tree networks. Discrete Applied Mathematics 154(16), 2387–2401 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Ogryczak, W.: Conditional median as a robust solution concept for uncapacitated location problems. TOP 18(1), 271–285 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Puerto, J., Rodríguez-Chía, A.M., Tamir, A.: Minimax regret single-facility ordered median location problems on networks. INFORMS Journal on Computing 21(1), 77–87 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Wang, H.: Minmax regret 1-facility location on uncertain path networks. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 733–743. Springer, Heidelberg (2013)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Yuya Higashikawa
    • 1
  • Mordecai J. Golin
    • 2
  • Naoki Katoh
    • 1
  1. 1.Department of Architecture and Architectural EngineeringKyoto UniversityJapan
  2. 2.Department of Computer Science and EngineeringThe Hong Kong University of Science and TechnologyHong Kong

Personalised recommendations