Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference5 articles.
1. R. M. Karp, Reducibility among combinatorial problems, in: R. E. Miller and J. W. Tatcher, eds.,Complexity of Computer Computation, Plenum, New York, 1972, pp. 85?103.
2. L. Kou, A faster approximation algorithm for the Steiner problem in graphs,Acta Inform.,27 (1990), 369?380.
3. L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees,Acta Inform.,15 (1981), 141?145.
4. K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs,Inform. Process. Lett.,27 (1988), 125?128.
5. P. Winter, Steiner problem in networks: a survey,Networks,17 (1987), 129?167.
Cited by
224 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献