FPTAS for half-products minimization with scheduling applications
Uložené v:
| Názov: | FPTAS for half-products minimization with scheduling applications |
|---|---|
| Autori: | Erel, E., Ghosh J.B. |
| Zdroj: | Discrete Applied Mathematics |
| Informácie o vydavateľovi: | Elsevier BV, 2008. |
| Rok vydania: | 2008 |
| Predmety: | Pseudo-boolean functions, Approximation scheme, Dynamic Programming, Scheduling, Polynomial approximation, Applied Mathematics, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Approximation Scheme, Half-products, Np-hard, Dynamic programming, 01 natural sciences, Special class, Nuclear propulsion, Fully polynomial time approximation scheme, Quadratic Pseudo-boolean Functions, Quadratic pseudo-boolean functions, Discrete Mathematics and Combinatorics, Boolean functions |
| Popis: | 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. |
| Druh dokumentu: | Article |
| Popis súboru: | application/pdf |
| Jazyk: | English |
| ISSN: | 0166-218X |
| DOI: | 10.1016/j.dam.2008.01.018 |
| Prístupová URL adresa: | https://hdl.handle.net/11693/23041 https://hdl.handle.net/11693/11652 |
| Rights: | Elsevier Non-Commercial |
| Prístupové číslo: | edsair.doi.dedup.....caa1e7bdd4c7fda9c071df1a1e8bbb32 |
| Databáza: | OpenAIRE |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstrakt: | 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. |
|---|---|
| ISSN: | 0166218X |
| DOI: | 10.1016/j.dam.2008.01.018 |