A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees