Question: Prove that the following 2-Sets decision problem is NP-complete. The input is a set of numbers {w1, . . . , wn} and a bound
Prove that the following 2-Sets decision problem is NP-complete. The input is a set of numbers {w1, . . . , wn} and a bound M. The question is: can {1, 2, . . . , n} be divided into two sets A, B (where A B = {1, 2, . . . , n} and A B = ) such that P P iA wi M and iB wi M. Hint: As a warmup consider the version where you are given two bounds MA and MB and the requirement is that P iA wi MA and P iB wi MB
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
