0
$\begingroup$

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.

$\endgroup$
2
  • $\begingroup$ Is this homework? $\endgroup$ Oct 4, 2013 at 10:38
  • $\begingroup$ no, it's not. A question from a friend. $\endgroup$
    – yaoliang
    Oct 5, 2013 at 5:25

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.