[1]
Patvardhan, C. et al. 2015. Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem. Informatica. 39, 3 (Sep. 2015).