NP-hard approximation problems in overlapping clustering. (Q1566100): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q922252
Import240304020342 (talk | contribs)
Set profile property.
 
(One intermediate revision by one other user not shown)
Property / author
 
Property / author: Jean-Pierre Barthelemy / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 03: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
    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