Author:
Higashikawa Yuya,Katoh Naoki,Teruyama Junichi,Watase Koji
Publisher
Springer International Publishing
Reference18 articles.
1. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: a survey and a new distributed algorithm. In: Proceedings of the the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 258–264 (2002)
2. Belmonte, R., Higashikawa, Y., Katoh, N., Okamoto, Y.: Polynomial-time approximability of the $$k$$-sink location problem. CoRR abs/1503.02835 (2015)
3. Lecture Notes in Computer Science;MA Bender,2000
4. Lecture Notes in Computer Science;R Benkoczi,2018
5. Benkoczi, R., Bhattacharya, B., Higashikawa, Y., Kameda, T., Katoh, N.: Minsum $$k$$-sink problem on path networks. Theor. Comput. Sci. 806, 388–401 (2020)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献