PATVARDHAN, C.; PRAKASH, V. Prem; SRIVASTAV, A. Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem. Informatica, [S. l.], v. 39, n. 3, 2015. Disponível em: https://puffbird.ijs.si/index.php/informatica/article/view/984. Acesso em: 23 jun. 2025.