# maximum weight k-edge problem

Given positive integer $k$ and an undirected graph $(V,E)$, with nonnegative (non-uniform) weights on the nodes. Find $k$ edges whose spanning nodes have the maximum weight.

Is this in P or NP? I tend to believe this has been studied before but could not find a reference.

-
Is this homework? –  Brendan McKay Oct 4 '13 at 10:38
no, it's not. A question from a friend. –  yaoliang Oct 5 '13 at 5:25