1. Bau Y, Ho CK, Ewe HT (2005) An ant colony optimization approach to the degree-constrained minimum spanning tree problem. In: Proceedings of the computational intelligence and security, international conference (CIS 2005), Xi’an, China, December 15–19, 2005, Part I, pp 657–662
2. Beasley JE, PC C (1996) A genetic algorithm for the set covering problem. Eur J Oper Res 94:394–404
3. Binh HTT, Nguyen TB (2008) New particle swarm optimization algorithm for solving degree constrained minimum spanning tree problem. In: Proceedings of the PRICAI 2008: trends in artificial intelligence, 10th Pacific rim international conference on artificial intelligence, Hanoi, Vietnam, December 15–19, 2008, pp 1077–1085
4. Boldon B, Deo N, Kumar N (1996) Minimum-weight degree-constrained spanning tree problem: heuristics and implementation on an SIMD parallel machine. Parallel Comput 22(3):369–382
5. Bui TN, Zrncic CM (2006) An ant-based algorithm for finding degree-constrained minimum spanning tree. In: Proceedings of the genetic and evolutionary computation conference, GECCO 2006, Seattle, Washington, USA, July 8–12, 2006, pp 11–18