Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem (2003)

by Günther R Raidl, Bryant A Julstrom
Venue:In SAC ’03: Proceedings of the 2003 ACM symposium on Applied computing