NP-hardness of some max-min clustering problems (Q2026156)

From MaRDI portal
Revision as of 01:14, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
NP-hardness of some max-min clustering problems
scientific article

    Statements

    title
    NP-hardness of some max-min clustering problems (English)
    0 references
    author
    Alexander Kel'Manov
    0 references
    Vladimir Khandeev
    0 references
    Artem V. Pyatkin
    0 references
    publication date
    18 May 2021
    0 references
    zbMATH DE Number
    7349419
    0 references
    zbMATH Keywords
    Euclidean space
    0 references
    clustering
    0 references
    max-min problem
    0 references
    NP-hardness
    0 references
    quadratic variation
    0 references
    OpenAlex ID
    W2910838307
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2026156&oldid=32547100"
    Powered by MediaWiki