Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem. (2015). Informatica, 39(3). https://puffbird.ijs.si/index.php/informatica/article/view/984