NP-hardness of Euclidean sum-of-squares clustering (Q1009338)

From MaRDI portal
Revision as of 01:33, 14 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/ml/AloiseDHP09, #quickstatements; #temporary_batch_1731543907597)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
NP-hardness of Euclidean sum-of-squares clustering
scientific article

    Statements

    title
    NP-hardness of Euclidean sum-of-squares clustering (English)
    0 references
    author
    Daniel Aloise
    0 references
    Amit Deshpande
    0 references
    Preyas Popat
    0 references
    Pierre Hansen
    0 references
    publication date
    31 March 2009
    0 references
    zbMATH Keywords
    sum-of-squares clustering
    0 references
    complexity
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    62H30
    0 references
    68T05
    0 references
    zbMATH DE Number
    5537410
    0 references
    Wikidata QID
    Q56500747
    0 references
    OpenAlex ID
    W2086959852
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1009338&oldid=37911753"
    Powered by MediaWiki