Author:
Ito Takehiro,Kakimura Naonori,Kamiyama Naoyuki,Kobayashi Yusuke,Okamoto Yoshio,Shiitada Taichi
Publisher
Springer International Publishing
Reference12 articles.
1. Alumur, S., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190(1), 1–21 (2008)
2. Ba, S., Kawabata, A., Chatterjee, B.C., Oki, E.: Computational time complexity of allocation problem for distributed servers in real-time applications. In: Proceedings of 18th Asia-Pacific Network Operations and Management Symposium, pp. 1–4 (2016)
3. Byrka, J., Pensyl, T., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for
$$k$$
-median, and positive correlation in budgeted optimization. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 737–756 (2015)
4. Campbell, J.F.: Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72(2), 387–405 (1994)
5. Chen, L.-H., Cheng, D.-W., Hsieh, S.-Y., Hung, L.-J., Lee, C.-W., Wu, B.Y.: Approximation algorithms for single allocation
$$k$$
-hub center problem. In: Proceedings of the 33rd Workshop on Combinatorial Mathematics and Computation Theory (CMCT 2016), pp. 13–18 (2016)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献