When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

We derive results of the following flavor: If a combinatorial optimization problem can be formulated via a dynamic program of a certain structure and if the involved cost and transition functions satisfy certain arithmetical and structural conditions, then the optimization problem automatically poss...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:INFORMS journal on computing Ročník 12; číslo 1; s. 57 - 74
Hlavní autor: Woeginger, Gerhard J
Médium: Journal Article
Jazyk:angličtina
Vydáno: Linthicum INFORMS 22.12.2000
Institute for Operations Research and the Management Sciences
Témata:
Algorithms
approximate algorithm
Approximation
Dynamic programming
FPTAS
Optimization
Scheduling
Studies
worst-case analysis
ISSN:1091-9856, 1526-5528, 1091-9856
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We derive results of the following flavor: If a combinatorial optimization problem can be formulated via a dynamic program of a certain structure and if the involved cost and transition functions satisfy certain arithmetical and structural conditions, then the optimization problem automatically possesses a fully polynomial time approximation scheme (FPTAS). Our characterizations provide a natural and uniform approach to fully polynomial time approximation schemes. We illustrate their strength and generality by deducing from them the existence of FPTASs for a multitude of scheduling problems. Many known approximability results follow as corollaries from our main result.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1091-9856
1526-5528
1091-9856
DOI:10.1287/ijoc.12.1.57.11901