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

2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp. 743-754, 2017.

Cited by: 60|Bibtex|Views75|Links
EI
Keywords:
Fixed Parameter TractabilityHardness of ApproximationCliqueSet CoverDominating Set

Abstract:

We consider questions that arise from the intersection between the areas of approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The questions, which have been asked several times (e.g., [1], [2], [3]) are whether there is a non-trivial FPT-approximation algorithm for the Maximum Clique (Cliq...More

Code:

Data:

Your rating :
0

 

Tags
Comments