2
$\begingroup$

The maximization problem of the 3-way number partitioning reads as follows: maximize the smallest sum.
3-way number partitioning is known to be NP-hard.

Different results have been proved regarding various partition problems:

Is there any FPTAS for 3-way number partitioning's maximization problem?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.