I don't understand the exact relation between between FPT and FPTAS. Specifically, given an optimization problem P with fptas A does that imply that for any parameter (a computable map from the input to the integers) there is an FPT algorithm? It's standard that given an FPTAS, there is an FPT algorithm parameterized by the solution cost. (see: Why are all problems in FPTAS also in FPT?).
Does the existence of an FPTAS have any bearing on the FPT status of a problem with given (i.e. not necessarily solution cost) parameter k? Thanks.
