Revision as of 19:03, 17 June 2009 edit Mohitsinghr (talk \| contribs) 13 edits No edit summary ← Previous edit		Revision as of 08:59, 13 August 2009 edit undo Hermel (talk \| contribs) Extended confirmed users, Pending changes reviewers 2,052 edits m →Approximation Algorithm: typo Next edit →
Line 13: ==Approximation Algorithm== ~~Furer~~Fürer and Raghavachari 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. ==References==

Degree-constrained spanning tree: Difference between revisions