NP-hard approximation problems in overlapping clustering. (Q1566100)

From MaRDI portal
Revision as of 03:55, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references