Answers are grounded in this paper and cite their sources.
The basic problem considered is that of interconnecting a given set of terminals with a shortest possible network of direct links. Simple and practical procedures are given for solving this problem both graphically and computationally. It develops that these procedures also provide solutions for a much broader class of problems, containing other examples of practical interest.
No takes yet. Share an insight, caveat, or question.
R. C. Prim (1957) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: