Is there any reference on the hardness of approximation for 2-partition problem?
From the Wikipedia page on the Partition problem: "...there are fully polynomial-time approximation schemes for the subset-sum problem, and hence for the partition problem as well". The references given there are
Kellerer, Pferschy, Pisinger and Martello, Toth.