Minimum-diameter spanning tree

In metric geometry and computational geometry, a minimum-diameter spanning tree of a finite set of points in a metric space is a spanning tree in which the diameter (the longest path length in the tree between two of its points) is as small as possible. == In general metric spaces == It is always possible to find a minimum-diameter spanning tree with one or two vertices that are not leaves.

This neuron ends here.