1. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
2. Approximating the minimum degree spanning tree to within one from the optimal degree;Fürer,1992
3. A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees;Könemann;SIAM J. Comput.,2002
4. Minimum bounded degree spanning trees;Goemans,2006
5. Approximating minimum bounded degree spanning trees to within one of optimal;Singh,2007