Author:
Gao Jiawen,Gao Suogang,Liu Wen,Wu Weili,Du Ding-Zhu,Hou Bo
Publisher
Springer Science and Business Media LLC
Reference18 articles.
1. Agrawal, A., Klein, P., Rawi, R.: When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput. 24, 440–456 (1995)
2. Angel, E., Thang, N.K., Singh, S.: Approximating $$k$$-forest with resource augmentation: a primal-dual approach. Theor. Comput. Sci. 788, 12–20 (2019)
3. Arora, S., Karakostas, G.: A $$2+\varepsilon $$ approximation algorithm for the $$k$$-MST problem. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 754–759 (2000)
4. Arya, S., Ramesh, H.: A $$2.5$$-factor approximation algorithm for the $$k$$-MST problem. Inf. Process. Lett. 65, 117–118 (1998)
5. Byrka, J., Grandoni, F., Rothvoss, T., Sanità, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60, 6:1-6:33 (2013)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Restriction and Steiner Tree;Introduction to Combinatorial Optimization;2022