A 0.3622-approximation algorithm for the maximum \(k\)-edge-colored clustering problem (Q4965094)
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: A 0.3622-approximation algorithm for the maximum k-edge-colored clustering problem |
scientific article; zbMATH DE number 7315666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 0.3622-approximation algorithm for the maximum \(k\)-edge-colored clustering problem |
scientific article; zbMATH DE number 7315666 |
Statements
A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem (English)
0 references
25 February 2021
0 references
clustering problem
0 references
edge-colored graph
0 references
linear relaxation
0 references
approximation algorithm
0 references
worst-case analysis
0 references
0 references
0.9564849138259888
0 references
0.8867358565330505
0 references
0.8838096857070923
0 references
0.8817529082298279
0 references
0.8106592893600464
0 references
