A Sausage Heuristic for Steiner Minimal Trees in Three-Dimensional Euclidean Space

Abstract  Given a set V of size N4 vertices in a metric space, how can one interconnect them with the possible use of a set S of size M vertices not in the set V, but in the same metric space, so that the cumulative cost of the inter-connections