# Poly-time approximation scheme for problems with pseudo-polynomial time algorithms

The question is: Does a poly-time approximation scheme always exist for NP-complete problems that have pseudo-polynomial time algorithms (like knapsack for example)?

They prove how pseudo-polynomial algorithms and FPTASs (that is PTASs whose time complexity is polynomial in $1/\epsilon$) are related.