Author:
Huang Chao-Wen,Lee Chia-Wei,Gao Huang-Ming,Hsieh Sun-Yuan
Subject
Applied Mathematics,Control and Optimization,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,General Mathematics
Reference34 articles.
1. Proof verification and the hardness of approximation problems;Arora;Journal of the Association for Computing Machinery,1998
2. P. Berman, M. Karpinski, 87-approximation algorithm for (1,2)-TSP, in: Proceedings of the Seventeenth Annual ACM–SIAM Symposium on Discrete Algorithm, 2006, pp. 641–648.
3. Improved approximations for the Steiner tree problem;Berman;Journal of Algorithms,1994
4. Faster exact algorithms for Steiner tree in planar networks;Bern;Networks,1990
5. The Steiner problem with edge lengths 1 and 2;Bern;Information Processing Letters,1989
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献