Approximation Scheme

An approximation scheme is an approximation algorithm that takes as input an instance of the problem and a value $\epsilon$> 0, such that the algorithm has a relative error bound $\epsilon$.

The approximation scheme is poly-time if it runs in time polynomial in the size n of the input.

The approximation scheme is fully poly-time if it runs in time polynomial in 1/$\epsilon$ and n.

T(n) = f(1/$\epsilon$, n)