A survey on approximation in parameterized complexity: Hardness and algorithms

Andreas E. Feldmann, C. S. Karthik, Euiwoong Lee, Pasin Manurangsi

Research output: Contribution to journalArticlepeer-review

27 Scopus citations


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.

Original languageEnglish (US)
Article number146
Issue number6
StatePublished - Jun 1 2020
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Numerical Analysis
  • Computational Theory and Mathematics
  • Computational Mathematics


  • Approximation algorithms
  • Hardness of approximation
  • Parameterized complexity


Dive into the research topics of 'A survey on approximation in parameterized complexity: Hardness and algorithms'. Together they form a unique fingerprint.

Cite this