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

page 8

page 11

page 15

page 19

page 22

page 23

page 30

page 32

research
02/27/2023

A Brief Survey on the Approximation Theory for Sequence Modelling

We survey current developments in the approximation theory of sequence m...
research
06/30/2021

Grid Recognition: Classical and Parameterized Computational Perspectives

Grid graphs, and, more generally, k× r grid graphs, form one of the most...
research
08/07/2019

A hardness of approximation result in metric geometry

We show that it is NP-hard to approximate the hyperspherical radius of a...
research
07/28/2020

Algorithmic Fractal Dimensions in Geometric Measure Theory

The development of algorithmic fractal dimensions in this century has ha...
research
02/27/2021

A Survey on Physarum Polycephalum Intelligent Foraging Behaviour and Bio-Inspired Applications

In recent years, research on Physarum polycephalum has become more popul...
research
10/30/2012

An Atypical Survey of Typical-Case Heuristic Algorithms

Heuristic approaches often do so well that they seem to pretty much alwa...
research
07/25/2022

A Survey on Graph Problems Parameterized Above and Below Guaranteed Values

We survey the field of algorithms and complexity for graph problems para...

Please sign up or login with your details

Forgot password? Click here to reset