A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem (Q4965094)
From MaRDI portal
scientific article; zbMATH DE number 7315666
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
