论文标题
参数化复杂性近似的调查:硬度和算法
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
论文作者
论文摘要
参数化和近似是应对NP硬性问题的两种流行方式。最近,这两者也已被合并,以得出许多有趣的结果。我们从算法和硬度的角度来调查该领域的发展,重点是新技术和潜在的未来研究方向。
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.