The Planar k-Means Problem is NP-Hard (Q3605504): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_24 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2103718624 / rank | |||
Normal rank | |||
Revision as of 00:05, 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
