An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (Q3186839): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s1990478915040067 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2275454988 / rank | |||
Normal rank | |||
Latest revision as of 10:28, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors |
scientific article |
Statements
An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (English)
0 references
12 August 2016
0 references
partitioning
0 references
vector subset
0 references
squared Euclidean distance
0 references
NP-hardness
0 references
exact pseudopolynomial algorithm
0 references
0 references
0 references
0 references
0 references
