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; zbMATH DE number 5510268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Planar k-Means Problem is NP-Hard |
scientific article; zbMATH DE number 5510268 |
Statements
The Planar k-Means Problem is NP-Hard (English)
0 references
24 February 2009
0 references
0 references
0.99999976
0 references
0.85339785
0 references
0.8516663
0 references
0.8438828
0 references
0.83928525
0 references
0.83928525
0 references
0.83902144
0 references
0.8363777
0 references
