A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

06/08/2020
by   Andreas Emil Feldmann, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset