A fast algorithm for Steiner trees
โ
L. Kou; G. Markowsky; L. Berman
๐
Article
๐
1981
๐
Springer-Verlag
๐
English
โ 248 KB
Given an undirected distance graph G = (V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and S___ V is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that s