The Planar k-Means Problem is NP-Hard (Q3605504)

From MaRDI portal
Revision as of 15:22, 28 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
The Planar k-Means Problem is NP-Hard
scientific article

    Statements

    The Planar k-Means Problem is NP-Hard (English)
    0 references
    0 references
    0 references
    0 references
    24 February 2009
    0 references

    Identifiers