There are many results and conjectures about connections between approximability of optimization problems and the parameterized complexity of their natural parameterized counterparts. This includes the relation between efficient PTASs and fixed-parameter tractability as well as the general impression that constant approximability is closely related to the existence of a polynomial kernelization. Michael will summarize and explain some of these results and point out new research opportunities.