Approximation algorithms for two variants of correlation clustering problem (Q2156281)
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: Approximation algorithms for two variants of correlation clustering problem |
scientific article; zbMATH DE number 7558373
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for two variants of correlation clustering problem |
scientific article; zbMATH DE number 7558373 |
Statements
Approximation algorithms for two variants of correlation clustering problem (English)
0 references
18 July 2022
0 references
correlation clustering
0 references
uncertain graphs
0 references
non-uniform hard constrained cluster sizes
0 references
approximation algorithm
0 references
0 references
0 references
0.8268957138061523
0 references
0.8229722380638123
0 references
0.8223677277565002
0 references
0.8149217963218689
0 references
0.8147661685943604
0 references
