Author:
Chen Yen Hung,Liao Gwo-Liang,Tang Chuan Yi
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Arora, S., Karakostas, G.: A 2 + ε approximation algorithm for the k-MST problem. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 754–759 (2000)
2. Arya, S., Ramesh, H.: A 2.5-Factor approximation algorithm for the k-MST problem. Information Processing Letters 65, 117–118 (1998)
3. Blum, A., Ravi, R., Vempala, S.: A constant-factor approximation algorithm for the k-MST problem. Journal of Computer and System Sciences 58, 101–108 (1999)
4. Lecture Notes in Computer Science;Y.H. Chen,2004
5. Chen, Y.H., Wu, B.Y., Tang, C.Y.: Approximation algorithms for some k-source shortest paths spanning tree problems. Networks 47, 147–156 (2006)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献