Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014)
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: Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems |
scientific article; zbMATH DE number 7607908
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems |
scientific article; zbMATH DE number 7607908 |
Statements
Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (English)
0 references
26 October 2022
0 references
Euclidean space
0 references
2-clustering
0 references
largest subset
0 references
NP-hardness
0 references
exact algorithm
0 references
pseudopolynomial-time solvability
0 references
0 references
0 references
0 references
0 references
