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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	INFORMS journal on computing Jg. 12; H. 1; S. 57 - 74
1. Verfasser:	Woeginger, Gerhard J
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Linthicum INFORMS 22.12.2000 Institute for Operations Research and the Management Sciences
Schlagworte:	Algorithms approximate algorithm Approximation Dynamic programming FPTAS Optimization Scheduling Studies worst-case analysis
ISSN:	1091-9856, 1526-5528, 1091-9856
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!