An FPTAS for a vector subset search problem (Q5264739): 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/s1990478914030041 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969181306 / rank | |||
Normal rank | |||
Latest revision as of 08:24, 30 July 2024
scientific article; zbMATH DE number 6466097
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
