When does a dynamic programming formulation guarantee the existence of an FPTAS?

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1999, Pages 820-829

  Woeginger, Gerhard J ^a  

^a Inst fur Mathematik B   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; DYNAMIC PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS;

FULLY POLYNOMIAL TIME APPROXIMATION SCHEME (FPTAS);

ALGORITHMS;

EID: 0032803604     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)