Author:
Higashikawa Yuya,Cheng Siu-Wing,Kameda Tsunehiko,Katoh Naoki,Saburi Shun
Funder
Japan Society for the Promotion of Science
Core Research for Evolutional Science and Technology
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference19 articles.
1. Arumugam, G.P., Augustine, J., Golin, M.J., Srikanthan, P.: A polynomial time algorithm for minimax-regret evacuation on a dynamic path, CoRR, 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. Bhattacharya, B., Kameda, T.: A linear time algorithm for computing minmax regret 1-median on a tree. In: Proceedings of the 18th Annual International Computing and Combinatorics Conference (COCOON 2012), LNCS 7434, pp. 1–12 (2012)
4. Bhattacharya, B., Kameda, T.: Improved algorithms for computing minmax regret 1-sink and 2-sink on path network. In: Proceedings of the 8th Combinatorial Optimization and Applications (COCOA 2014), LNCS 8881, pp. 146–160 (2014)
5. Bhattacharya, B., Kameda, T., Song, Z.: A linear time algorithm for computing minmax regret 1-median on a tree network. Algorithmica , 1–20 (2013)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献