What I'm trying to do is to show a problem in NP can be reduced to the min weight vertex cover problem
I've chosen the max independent weight problem = input: A graph G with weights on each vertex, output: An independent set with the max total weight
Before reducing, I've tried to show that the max indep. weight problem is in NP (which is usually the first step in these reductions). I'm trying to construct a verification algorithm for this problem; but I'm stuck on trying to show that the verification algorithm can check if a certificate is the max indep. set in polynomial time.
Any guidance or comments would be greatly appreciated. Thanks