From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More

SIAM J. Comput., pp. 772-810, 2020.

Cited by: 0|Bibtex|Views2|Links
EI

Abstract:

We consider questions that arise from the intersection between the areas of polynomial-time approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable (FPT) algorithms....

Code:

Data:

Your rating :
0

 

Tags
Comments