Concepedia

A faster approximation algorithm for the Steiner problem in graphs

Y. F. Wu, Peter Widmayer, Chris K.C. Wong

Acta Informatica · 1986 · 102 citations · 10 references

DOI

Concepts

References

10

A note on two problems in connexion with graphs

E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations

, , +6

On the shortest spanning subtree of a graph and the traveling salesman problem

Joseph B. Kruskal · Proceedings of the American Mathematical Society · 1956 · 5.1K citations · Full text

, , +11

A fast algorithm for Steiner trees

Lawrence T. Kou, George Markowsky, L. Berman · Acta Informatica · 1981 · 1.2K citations

, , +8

Steiner Minimal Trees

E. N. Gilbert, H. O. Pollak · SIAM Journal on Applied Mathematics · 1968 · 938 citations

, , +8

An approximate solution for the Steiner problem in graphs

Haruhisa Takahashi, A Matsuyama · Mathematica japonica · 1980 · 884 citations

, , +10