Fast heuristics for large instances of the euclidean bounded diameter minimum spanning tree problem