Woeginger, G. J. (2000). When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? INFORMS journal on computing, 12(1), 57-74. https://doi.org/10.1287/ijoc.12.1.57.11901
Chicago-Zitierstil (17. Ausg.)Woeginger, Gerhard J. "When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?" INFORMS Journal on Computing 12, no. 1 (2000): 57-74. https://doi.org/10.1287/ijoc.12.1.57.11901.
MLA-Zitierstil (9. Ausg.)Woeginger, Gerhard J. "When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?" INFORMS Journal on Computing, vol. 12, no. 1, 2000, pp. 57-74, https://doi.org/10.1287/ijoc.12.1.57.11901.