论文信息 - Steiner Tree Problem

Steiner Tree Problem

Consider an undirected graph G, each of its edges is labeled with a distance. Let S be a specified subset of nodes of G. The Steiner tree problem is to find a tree of G that spans S with minimal total distance on its edges. The nodes in the set S are called Steiner points.

H. T. Lau

[1] R. Prim. Shortest connection networks and some generalizations , 1957 .

[2] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.