From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More

FOCS, pp. 743-754, 2017.

Cited by: 42|Bibtex|Views45|Links
EI

Abstract:

We consider questions that arise from the intersection between theareas of approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The questions, which have been asked several times (e.g., [Marx, 2008; Fellow et al., 2012; Downey u0026 Fellow 2013]) are whether there is a non-trivial FPT-approxi...More

Code:

Data:

Your rating :
0

 

Tags
Comments