Revision as of 18:59, 17 June 2009 edit Mohitsinghr (talk \| contribs) 13 edits No edit summary ← Previous edit		Revision as of 19:00, 17 June 2009 edit undo Mohitsinghr (talk \| contribs) 13 edits No edit summary Next edit →
Line 13: ==Approximation Algorithms== Furer and Raghavachari ~~give~~gave an approximation algorithm for the problem which either shows that there is no tree of maximum degree k or returns a tree of maximum degree k+1. ~~It is one of the~~ ==References==

Degree-constrained spanning tree: Difference between revisions