Author:
Luo Taibo,Li Hongmei,Ru Shaofeng,Tong Weitian,Xu Yinfeng
Funder
the MOE (Ministry of Education in China) Project of Humanities and Social Sciences
National Natural Science Foundation of China
the Fundamental Research Funds for the Central Universities
Natural Science Foundation of Shaanxi Province
Postdoctoral Research Foundation of China
Publisher
Springer Science and Business Media LLC
Reference25 articles.
1. Arumugam, G.P., Augustine, J., Golin, M.J., Strikanthan, P.: Minmax regret $$k$$-sink location on a dynamic path network with uniform capacities. Algorithmica 81(9), 3534–3585 (2019)
2. Benkoczi, R., Bhattacharya, B., Higashikawa, Y., Kameda, T., Katoh, N.: Minsum k-sink problem on path networks. Theor. Comput. Sci. 806(2), 388–401 (2020)
3. Berman, O., Yang, E.K.: Medi-centre location problems. J. Oper. Res. Soc. 42(4), 313–322 (1991)
4. Bhattacharya, B., Golin, M.J., Higashikawa, Y., Kameda, T., Katoh, N.: Improved algorithms for computing $$k$$-sink on dynamic flow path networks. In: Proceedings of the 15th International Symposium, Workshop on Algorithms and Data Structures (WADS), LNCS, vol. 10389, pp. 133–144 (2017)
5. Bhattacharya, B., Higashikawa, Y., Kameda, T., Katoh, N.: Minmax regret 1-sink for aggregate evacuation time on path networks. arXiv:1806.00814v1 (2018)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献