This question already has an answer here:
I want to know whether there is a relation between parameterized algorithms and approximation algorithms.
Like there will exist a fpt problem for problem P iff it have some f-approx algorithm.
I would be also happy if some one can give me reference.
Edit: It's just observation from my aspect that c-approx algo have fpt algo where c is constant. I am not able to prove it but I want contradicting example.
Also this implies there is a relation between kernel and the approximation algo.