A heuristic for Euclidean and rectilinear Steiner problems, European Journal of Operational Research, vol.58, 1992, pp284- 292
In this paper we present a heuristic for Euclidean and rectilinear Steiner problems. This heuristic is based upon finding optimal Steiner solutions for connected subgraphs of the minimal spanning tree of the entire vertex set. Computational results are given for randomly generated problems involving up to 10,000 vertices.
J E Beasley