1. Arumugam, G.P., Augustine, J., Golin, M.J., Srikanthan, P.: A polynomial time algorithm for minimax-regret evacuation on a dynamic path. CoRR abs/1404.5448 . arXiv:1404.5448
2. Averbakh, I., Berman, O.: Algorithms for the robust $$1$$ -center problem on a tree. Eur. J. Oper. Res. 123(2), 292–302 (2000)
3. Lecture Notes in Computer Science;B Bhattacharya,2012
4. Lecture Notes in Computer Science;B Bhattacharya,2014
5. Bhattacharya, B., Kameda, T., Song, Z.: A linear time algorithm for computing minmax regret $$1$$ -median on a tree network. Algorithmica 62, 1–20 (2013)