Publisher
Springer International Publishing
Reference14 articles.
1. Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for the generalized Steiner problem in networks. SIAM J. Comput. 24(3), 440–456 (1995)
2. Bateni, M., Hajiaghayi, M., Marx, D.: Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth. J. ACM 58(5), 1–21 (2011)
3. Bui, M., Butelle, F., Lavault, C.: A distributed algorithm for constructing a minimum diameter spanning tree. J. Parallel Distrib. Comput. 64(5), 571–577 (2004)
4. Ding, W., Qiu, K.: Algorithms for the minimum diameter terminal Steiner tree problem. J. Comb. Optim. 28(4), 837–853 (2014)
5. Dinitz, M., Kortsarz, G., Nutov, Z.: Improved approximation algorithm for Steiner $$k$$-forest with nearly uniform weights. In: 17th APPROX, pp. 115–127 (2014)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献