[1]
C. . Patvardhan, V. . . . . P. . Prakash, and A. . . . . . Srivastav, “Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem”, Informatica, vol. 39, no. 3, Sep. 2015, Accessed: Sep. 19, 2026. [Online]. Available: https://www.informatica.si/index.php/informatica/article/view/984