1. Achuthan NR, Caccetta L, Caccetta PA, Geelan JF (1994) Computational methods for the diameter restricted minimum weight spanning tree problem. Australasian J Combinat 10: 51–71
2. Borůvka O (1926) Pr̆ıspĕvek k r̆es̆enı otázky ekonomické stavby elektrovodnıch sıtı. Elektronický obzor 15: 153–154
3. Deo N, Micikevicius P (1999) A heuristic for the leaf-constrained minimum spanning tree problem. Congressus Numer 141: 61–72
4. Deo N, Abdalla A (2000) Computing a diameter-constrained minimum spanning tree in parallel. In: Bongiovanni G, Gambosi G, Petreschi R (eds) Algorithms and complexity, LNCS vol. 1767. Springer, Berlin, pp 17–31
5. Edelson W, Gargano ML (2002) Leaf-constrained minimal spanning trees solved by a genetic algorithm. Congres Numer 157: 41–48