Improved approximations for the max \(k\)-colored clustering problem (Q3453278)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6512650
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximations for the max \(k\)-colored clustering problem |
scientific article; zbMATH DE number 6512650 |
Statements
Improved Approximations for the Max k-Colored Clustering Problem (English)
0 references
20 November 2015
0 references
clustering
0 references
edge-colored graph
0 references
linear relaxation
0 references
randomized rounding
0 references
worst-case behavior analysis
0 references
0.887806236743927
0 references
0.8877010345458984
0 references
0.8867358565330505
0 references
0.8782694339752197
0 references
0.7988758683204651
0 references
