Author:
Reich Gabriele,Widmayer Peter
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. M.L. Fredman, R.E. Tarjan: Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms, Journal of the ACM, Vol. 34, 1987, 596–615.
2. R.M. Karp: Reducibility among Combinatorial Problems, Complexity of Computer Computations, New York, 1972, 85–103.
3. L. Kou, G. Markowsky, L. Berman: A Fast Algorithm for Steiner Trees, Acta Informatica, Vol. 15, 1981, 141–145.
4. L. Kou, K. Makki: An Even Faster Approximation Algorithm for the Steiner Tree Problem in Graphs, 18th Southeastern Conference on Combinatorics, Graph Theory, and Computing, 1987, 147–154.
5. K. Mehlhorn: Data Structures and Algorithms, Vol. 2: Graph Algorithms and NP-Completeness, Springer-Verlag, 1984.
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献