Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Feldmann et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: