A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
Data Structures and Algorithms
2020-06-09 v1 Computational Complexity
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.
Cite
@article{arxiv.2006.04411,
title = {A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms},
author = {Andreas Emil Feldmann and Karthik C. S. and Euiwoong Lee and Pasin Manurangsi},
journal= {arXiv preprint arXiv:2006.04411},
year = {2020}
}