Complexity of local search for Euclidean clustering problems (Q7260668)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8208384
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of local search for Euclidean clustering problems |
scientific article; zbMATH DE number 8208384 |
Statements
Complexity of local search for Euclidean clustering problems (English)
0 references
8 June 2026
0 references
local search
0 references
PLS-complete
0 references
max cut
0 references
\(k\)-means
0 references
partitioning problem
0 references
flip-neighborhood
0 references
0 references
0 references
0 references
