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

From MaRDI portal
Revision as of 09:49, 19 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q590541)
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
    24 February 2009
    0 references

    Identifiers