Approximability and inapproximability for maximum \(k\)-edge-colored clustering problem (Q2330548)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximability and inapproximability for maximum \(k\)-edge-colored clustering problem |
scientific article |
Statements
Approximability and inapproximability for maximum \(k\)-edge-colored clustering problem (English)
0 references
22 October 2019
0 references
clustering
0 references
edge-colored graph
0 references
randomized rounding
0 references
