Patvardhan C, Prakash VP, Srivastav A. Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem. IJCAI [Internet]. 2015 Sep. 1 [cited 2025 Jun. 23];39(3). Available from: https://puffbird.ijs.si/index.php/informatica/article/view/984