An FPTAS for a vector subset search problem (Q5264739)
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 6466097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An FPTAS for a vector subset search problem |
scientific article; zbMATH DE number 6466097 |
Statements
An FPTAS for a vector subset search problem (English)
0 references
27 July 2015
0 references
finding a vector subset
0 references
Euclidean space
0 references
minimum of the sum of squared distances
0 references
NP-hardness
0 references
fully polynomial time
0 references
approximation scheme
0 references
0 references
0 references
0.8551082015037537
0 references
0.8078233599662781
0 references
0.8059372305870056
0 references
0.8031641840934753
0 references
