An approximation scheme for the problem of finding a subsequence (Q4636841)
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: An approximation scheme for the problem of finding a subsequence |
scientific article; zbMATH DE number 6862673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation scheme for the problem of finding a subsequence |
scientific article; zbMATH DE number 6862673 |
Statements
An Approximation Scheme for the Problem of Finding a Subsequence (English)
0 references
20 April 2018
0 references
sequence
0 references
Euclidean space
0 references
minimum sum of squared distances
0 references
NP-hardness
0 references
FPTAS
0 references
0.8161077499389648
0 references
0.8159234523773193
0 references
0.8078577518463135
0 references
0.8059372305870056
0 references
