1. Arumugam, G.P., Augustine, J., Golin, M., Srikanthan, P.: A polynomial time algorithm for minimax-regret evacuation on a dynamic path.
arXiv:1404.5448
v1 [cs.DS] 22 April 2014
2. Benkoczi, R., Das, R.: The min-max sink location problem on dynamic cycle networks, October 2018. Submitted to a conference
3. Lecture Notes in Computer Science;B Bhattacharya,2017
4. Bhattacharya, B., Kameda, T.: Improved algorithms for computing minmax regret sinks on path and tree networks. Theor. Comput. Sci. 607, 411–425 (2015)
5. Chen, D., Golin, M.: Sink evacuation on trees with dynamic confluent flows. In: Hong, S.-H. (ed.) Leibniz International Proceedings in Informatics, 27th International Symposium on Algorithms and Computation (ISAAC), pp. 25:1–25:13 (2016)