A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

Abstract

Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results.

We survey developments in the area both from the algorithmic and hardness perspectives, with emphasis on new techniques and potential future research directions.

Keywords

• parameterized complexity
• approximation algorithms
• hardness of approximation