# Get subset of nodes from complete, weighted graph with minimum edge weights

I want to get the subset of k nodes from a complete, weighted graph with n nodes in total. Thus, the question is whether there is an algorithm to remove (n-k) nodes from a complete weighted graph so the subset with least edge weight remains.

Thanks, Christian

-
Not necessarily efficient? Just remove every possible subset of $n-k$ nodes and count what edge weight remains. –  Leen Droogendijk Oct 18 '13 at 14:22
Of course, that's correct. Any suggestions for a more efficient algorithm? Probably an existent one? –  Chris Oct 18 '13 at 16:11