Heuristics for Minimum Spanning K-tree Problem

Plane Triangulations Without Spanning 2-Trees

“…Cai [5] shows that there is no good approximation algorithm for weighted complete graphs in general, but there is such an algorithm when they satisfy the triangle inequality. Shangin and Pardalos [16] consider various heuristics for the spanning k-tree problem.…”