A. Agra, D. Cardoso, O. Cerfeira, and E. Rocha, A spanning star forest model for the diversity problem in automobile industry, ECCO XVIII, 2005.

S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, and M. Kyropoulou, An Improved Approximation Bound for Spanning Star Forest and Color Saving, MFCS, pp.90-101, 2009.
DOI : 10.1137/070682150

D. Chakrabarty and G. Goel, On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP, FOCS, pp.687-696, 2008.

N. Chen, R. Engelberg, C. T. Nguyen, P. Raghavendra, A. Rudra et al., Improved Approximation Algorithms for the Spanning Star Forest Problem, AP- PROX/RANDOM, pp.44-58, 2007.

V. Berry, S. Guillemot, F. Nicholas, and C. Paul, On the Approximation of Computing Evolutionary Trees, Proceedings of the Eleventh Annual International Computing and Combinatorics Conference, pp.115-123, 2005.
DOI : 10.1007/11533719_14
URL : https://hal.archives-ouvertes.fr/lirmm-00106451

J. He and H. Liang, On Variants of the Spanning Star Forest Problem, In FAW-AAIM, vol.38, issue.3, pp.70-81, 2011.
DOI : 10.1137/070682150

C. T. Nguyen, J. Shen, M. Hou, L. Sheng, W. Miller et al., Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment, SIAM Journal on Computing, vol.38, issue.3, pp.946-962, 2008.
DOI : 10.1137/070682150

D. West, Introduction to graph theory, 2000.