From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more (Q5115701)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more |
scientific article; zbMATH DE number 7236283
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more |
scientific article; zbMATH DE number 7236283 |
Statements
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (English)
0 references
18 August 2020
0 references
hardness of approximation
0 references
parameterized complexity
0 references
subexponential-time algorithms
0 references
fine-grained complexity
0 references
clique
0 references
dominating set
0 references
0 references
0.845841109752655
0 references
0.8247295022010803
0 references
0.8233622908592224
0 references
0.8099513053894043
0 references
0.7998438477516174
0 references
