I am trying to understand what is the PTAS, FPTAS and what is the difference between them.
I found this analysis:
but I cannot understand what do we mean by saying:
"....time complexity is polynomial in the input size and also polynomial in 1/ϵ" ?? Ok n has to do with the linear O(n) worst case that the algorithm runs. But O(1/ε) how does it work?