The Planar k-Means Problem is NP-Hard (Q3605504): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56449832, #quickstatements; #temporary_batch_1710972793655 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56449832 / rank | |||
Normal rank | |||
Revision as of 23:34, 20 March 2024
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
