Partition Problem - The k-partition Problem

The k-partition Problem

There is a problem called the 3-partition problem which is to partition the set S into |S|/3 triples each with the same sum. The 3-partition problem is quite different than the Partition Problem and has no pseudo-polynomial time algorithm unless P = NP. For generalizations of the partition problem, see the Bin packing problem.

Read more about this topic:  Partition Problem

Famous quotes containing the word problem:

    Every reform was once a private opinion, and when it shall be a private opinion again, it will solve the problem of the age.
    Ralph Waldo Emerson (1803–1882)