On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155)
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: On the hardness of labeled correlation clustering problem: a parameterized complexity view |
scientific article; zbMATH DE number 6520544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of labeled correlation clustering problem: a parameterized complexity view |
scientific article; zbMATH DE number 6520544 |
Statements
On the hardness of labeled correlation clustering problem: a parameterized complexity view (English)
0 references
11 December 2015
0 references
labeled correlation clustering
0 references
parameterized complexity
0 references
lower bound
0 references
strong exponential time hypothesis
0 references
0.9781193
0 references
0.9530488
0 references
0.89884853
0 references
0.8900302
0 references
0.8895231
0 references
0.87817425
0 references
0.87676233
0 references
0.8725568
0 references
0.87154967
0 references
