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

From MaRDI portal
Revision as of 04: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

    title
    NP-hard approximation problems in overlapping clustering. (English)
    0 references
    author
    François Brucker
    0 references
    Jean-Pierre Barthelemy
    0 references
    publication date
    2001
    0 references
    Mathematics Subject Classification ID
    91C20
    0 references
    65Y20
    0 references
    91C15
    0 references
    zbMATH DE Number
    1921231
    0 references
    zbMATH Keywords
    approximation problems
    0 references
    complexity
    0 references
    pseudo-hierarchies
    0 references
    \(k\)-hierarchies
    0 references
    \(k\)-weak hierarchies
    0 references
    Robinson dissimilarities
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1566100&oldid=26343667"
    Powered by MediaWiki