Erel, E.Ghosh, J. B.2016-02-082016-02-0820080166-218Xhttp://hdl.handle.net/11693/23041A special class of quadratic pseudo-boolean functions called "half-products" (HP) has recently been introduced. It has been shown that HP minimization, while NP-hard, admits a fully polynomial time approximation scheme (FPTAS). In this note, we provide a more efficient FPTAS. We further show how an FPTAS can also be derived for the general case where the HP function is augmented by a problem-dependent constant and can justifiably be assumed to be nonnegative. This leads to an FPTAS for certain partitioning type problems, including many from the field of scheduling.EnglishApproximation schemeDynamic programmingQuadratic pseudo-boolean functionsNuclear propulsionPolynomial approximationSchedulingApproximation schemeDynamic programmingFully polynomial time approximation schemeHalf-productsNp-hardPseudo-boolean functionsQuadratic pseudo-boolean functionsSpecial classBoolean functionsArticle10.1016/j.dam.2008.01.018