A fast algorithm for Steiner trees
Lawrence T. Kou, George Markowsky, Leonard Berman · Acta Informatica · 1981
Cited by 1,188 works. doi:10.1007/bf00288961
Authors
References
- Reducibility among Combinatorial Problems
- A note on two problems in connexion with graphs
- Algorithm 97: Shortest path
- Steiner Minimal Trees
- Finding Minimum Spanning Trees
- An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
- Some NP-complete geometric problems
- On Steiner Minimal Trees with Rectilinear Distance
- All shortest distances in a graph. An improvement to Dantzig's inductive algorithm