Exact pseudopolynomial algorithm for one sequence partitioning problem (Q2362334)
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 6740841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact pseudopolynomial algorithm for one sequence partitioning problem |
scientific article; zbMATH DE number 6740841 |
Statements
Exact pseudopolynomial algorithm for one sequence partitioning problem (English)
0 references
7 July 2017
0 references
partition
0 references
sequence of vectors
0 references
Euclidean space
0 references
minimal sum of squared distances
0 references
NP-hardness
0 references
exact pseudopolynomial algorithm
0 references
0.9206505417823792
0 references
0.9197959899902344
0 references
0.8716196417808533
0 references
0.869751513004303
0 references
0.8658884763717651
0 references
