Author:
Chen Chi-Yeh,Hsieh Sun-Yuan
Funder
Ministry of Science and Technology, Taiwan
Intelligent Manufacturing Research Center
Kementerian Pendidikan Malaysia
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference25 articles.
1. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
2. The steiner tree problem on graphs: inapproximability results;Chlebík;Theor. Comput. Sci.,2008
3. An improved approximation algorithm for the terminal steiner tree problem;Chen,2011
4. On the partial terminal steiner tree problem;Hsieh;J. Supercomput.,2007
5. 1.25-approximation algorithm for steiner tree problem with distances 1 and 2;Berman,2009
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献