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

Full description

Bibliographic Details

Published in:	INFORMS journal on computing Vol. 12; no. 1; pp. 57 - 74
Main Author:	Woeginger, Gerhard J
Format:	Journal Article
Language:	English
Published:	Linthicum INFORMS 22.12.2000 Institute for Operations Research and the Management Sciences
Subjects:	Algorithms approximate algorithm Approximation Dynamic programming FPTAS Optimization Scheduling Studies worst-case analysis
ISSN:	1091-9856, 1526-5528, 1091-9856
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!