1.
Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem. IJCAI. 2015;39(3). Accessed July 21, 2026. https://www.informatica.si/index.php/informatica/article/view/984