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.

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

0

Reset to default

You must log in to answer this question.