The planar \(k\)-means problem is NP-hard (Q441888)
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
8 August 2012
0 references
