Polynomial-time approximation schemes
An optimization problem is said to have a PTAS if for every
e > 0 there exists an algorithm A(e) that finds a solution
that is within a factor of 1 - e of optimum and whose
running time is O(na(e)). NP-hard optimization problems
may still have a PTAS if a(e) increases to infinity as e