MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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.

share|cite|improve this question
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

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.