NP-hard approximation problems in overlapping clustering. (Q1566100): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Jean-Pierre Barthelemy / rank | |||
| Property / author | |||
| Property / author: Jean-Pierre Barthelemy / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:55, 5 March 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
