1. Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: What would Edmonds do? Augmenting Paths and Witnesses for degree-bounded MSTs. In: Proceedings of 8th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (2005)
2. Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: Push Relabel and an Improved Approximation Algorithm for the Bounded-degree MST Problem. In: ICALP (2006)
3. Ellingham, M., Zha, X.: Toughness, trees and walks. J. Graph Theory 33, 125–137 (2000)
4. Fischer, T.: Optimizing the degree of minimum weight spanning trees. Technical report, Department of Computer Science, Cornell University (1993)
5. Furer, M., Raghavachari, B.: Approximating the minimum degree spanning tree to within one from the optimal degree. In: SODA 1992: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 317–324 (1992): Society for Industrial and Applied Mathematics