FPTAS for half-products minimization with scheduling applications
Author
Erel, E.
Ghosh, J. B.
Date
2008Source Title
Discrete Applied Mathematics
Print ISSN
0166-218X
Publisher
Elsevier
Volume
156
Issue
15
Pages
3046 - 3056
Language
English
Type
ArticleItem Usage Stats
121
views
views
89
downloads
downloads
Abstract
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, 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.
Keywords
Approximation schemeDynamic programming
Quadratic pseudo-boolean functions
Nuclear propulsion
Polynomial approximation
Scheduling
Approximation scheme
Dynamic programming
Fully polynomial time approximation scheme
Half-products
Np-hard
Pseudo-boolean functions
Quadratic pseudo-boolean functions
Special class
Boolean functions