This talk is based on a recent survey by Daniel Marx, "Parameterized complexity and approximation algorithms". It covers some ways of combining paramerized complexity with approximation to (hopefully) deal with so far intractable and inapproximable problems.