Publisher
Springer International Publishing
Reference19 articles.
1. Lecture Notes in Computer Science;A Archer,2001
2. Bhattacharya, B., Shi, Q.S.: Improved algorithms to network
$$p$$
p
-center location problems. Comput. Geom. 47, 307–315 (2014)
3. Chan, T.M.: A (slightly) faster algorithm for Klees measure problem. In: Proceedings of the 24th ACM SoCG, pp. 94–100 (2008)
4. Chuzhoy, J., Guha, S., Halperin, E., Kortsarz, G., Khanna, S., Naor, S.: Asymmetric
$$k$$
k
-center is
$$\log ^\ast n$$
log
*
n
-hard to approximate. In: Proceedings of the 36th STOC, pp. 21–27 (2004)
5. Ding, W., Qiu, K.: Algorithms for the minimum diameter terminal steiner tree problem. J. Comb. Optim. 28(4), 837–853 (2014)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献