Revision as of 19:51, 12 January 2011 edit 94.75.74.13 (talk) →Degree-constrained minimum spanning tree ← Previous edit		Revision as of 17:02, 15 September 2011 edit undo 137.132.3.9 (talk) corrected a typo Next edit →
Line 15: In GECCO ’06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 11–18, New York, NY, USA. ACM.</ref> Heuristic algorithms that can solve the problem in ~~polinomial~~polynomial time have been proposed, including Genetic and Ant-Based Algorithms. ==Approximation Algorithm==

Degree-constrained spanning tree: Difference between revisions