Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. S. E. Dreyfus, R. A. Wagner: The Steiner Problem in Graphs, Networks, Vol. 1, 1971, 195–207.
2. M. L. Fredman, R. E. Tarjan: Fibonacci Heaps and Their Uses in Improved Networks Optimization Algorithms, Journal of the ACM, Vol. 34, 1987, 596–615.
3. M. R. Garey, D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
4. R. M. Karp: Reducibility among Combinatorial Problems, Complexity of Computer Computations, New York, 1972, 85–103.
5. L. Kou, G. Markowsky, L. Berman: A Fast Algorithm for Steiner Trees, Acta Informatica, Vol. 15, 1981, 141–145.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献