FPTAS for half-products minimization with scheduling applications
Date
2008
Authors
Erel, E.
Ghosh, J. B.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
1
views
views
5
downloads
downloads
Citation Stats
Series
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.
Source Title
Discrete Applied Mathematics
Publisher
Elsevier
Course
Other identifiers
Book Title
Keywords
Approximation scheme, Dynamic 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
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Collections
Language
English