1. Arumugam, G.P., Augustine, J., Golin, M., Srikanthan, P.: A polynomial time algorithm for minimax-regret evacuation on a dynamic path.
arXiv:1404,5448v1
[cs.DS], 22 April 2014, 165 (2014)
2. Lecture Notes in Computer Science;B Bhattacharya,2017
3. Bhattacharya, B., Kameda, T.: Improved algorithms for computing minmax regret sinks on path and tree networks. Theoret. Comput. Sci. 607, 411–425 (2015)
4. Chen, D., Golin, M.: Sink evacuation on trees with dynamic confluent flows. In: Hong, S.-H. (ed.) 27th International Symposium on Algorithms and Computation (ISAAC), Leibniz International Proceedings in Informatics, pp. 25:1–25:13 (2016)
5. Lecture Notes in Computer Science;S-W Cheng,2013