The problem of determining a minimum cost connected network (i.e., weighted graph) G that spans a given subset of vertices is known in the literature as the Steiner problem in networks. We survey exact algorithms and heuristics which appeared in the published literature. We also discuss problems related to the Steiner problem in networks.
No takes yet. Share an insight, caveat, or question.
Paweł Winter (1987) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: