The 0-1 Knapsack problem is known as NP-complete. But if the weight for each item are the same, the problem is still NP-complete?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
The 0-1 Knapsack problem is known as NP-complete. But if the weight for each item are the same, the problem is still NP-complete?
No, because you always just take whatever items are the most valuable.