NP-hard approximation problems in overlapping clustering. (Q1566100): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:13, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-hard approximation problems in overlapping clustering. |
scientific article |
Statements
NP-hard approximation problems in overlapping clustering. (English)
0 references
2001
0 references
approximation problems
0 references
complexity
0 references
pseudo-hierarchies
0 references
\(k\)-hierarchies
0 references
\(k\)-weak hierarchies
0 references
Robinson dissimilarities
0 references
