The Esau-Williams algorithm is one of the best known heuristics for the capacitated minimum spanning tree problem. This paper describes a simple enhancement of this heuristic. On benchmark test ...

Moreover, there is a unique functional form aggregating dissimilarity into diversity, the length of a minimum spanning tree. Examples are taxonomic hierarchies and lines representing uni-dimensional ...