The set-partition problem takes as input a set S of numbers. The question is whether the numbers
Question:
The set-partition problem takes as input a set S of numbers. The question is whether the numbers can be partitioned into two sets A and A ̅ = S − A such that ∑x ∈ A x = Px ∈ A̅ x. Show that the set-partition problem is NP-complete.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Question Posted: