The Planar k-Means Problem is NP-Hard (Q3605504)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Planar k-Means Problem is NP-Hard |
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
24 February 2009
0 references
