A Euclidean minimum spanning tree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system of line segments with the points as endpoints, minimizing the total length of the segments.

In mathematics, a minimum bottleneck spanning tree in an undirected graph is a spanning tree in which the most expensive edge is as cheap as possible.