Patvardhan C, Prakash VP, Srivastav A. Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem. Informatica. 2015;39(3). Accessed September 19, 2026. https://www.informatica.si/index.php/informatica/article/view/984