# FPTAS for Number Partition Problem

I've been given a task to implement two algorithms (an exact algorithm and fully polynomial approximation scheme) for number partitioning problem. I found out that I can use some modification of heuristic approach (like complete differencing tree method) or just plain brute-force for the former, but I have a lot of trouble with the latter... can anyone point some resources where FPTAS for NPP is discussed or guidelines how to construct one?

Cheers

• What is the "number partition problem"? $k$-partition? – Juho Apr 2 '13 at 20:20
• No, it's just standard Partition problem, with two subsets having equal/nearly equal sums of their elements. "Number Partition Problem" is a term that I found in some literature (I think it's used to distinguish it from graph partitioning). – barti90 Apr 3 '13 at 18:48