%0 Journal Article %T Approximation Schemes for the 3-Partitioning Problems %A Jianbo Li %A Honglin Ding %J Communications and Network %P 90-95 %@ 1947-3826 %D 2013 %I Scientific Research Publishing %R 10.4236/cn.2013.51B021 %X The 3-partitioning problem is to decide whether a given multiset of nonnegative integers can be partitioned into triples that all have the same sum. It is considerably used to prove the strong NP-hardness of many scheduling problems. In this paper, we consider four optimization versions of the 3-partitioning problem, and then present four polynomial time approximation schemes for these problems. %K 3-partitioning Problem %K Approximation Scheme %U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=39134