Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A 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,  provide a more efficient FPTAS.  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.
['Erdal Erel', 'Jay B. Ghosh']
I am writing a research paper on a idea FPTAS for half-products minimization with scheduling applications
[{"from": "human", "value": "I am writing a research paper on a idea FPTAS for half-products minimization with scheduling applications"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A 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,  provide a more efficient FPTAS.  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."}]