finding k triangles that connect all vertices with minimum weight in a undirected complete graph

39 Views Asked by At

For a complete undirected graph, each edge has a positive weight. My problem is to find a way to collect K triangles including all vertices from all triangles in the graph so that the sum of weight on edges of K triangles is minimum. The question is like MST. But I want to get more redundancy. Does this algorithm exist?