Complexity and approximation of finding the longest vector sum (Q1785063)
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: Complexity and approximation of finding the longest vector sum |
scientific article; zbMATH DE number 6945074
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximation of finding the longest vector sum |
scientific article; zbMATH DE number 6945074 |
Statements
Complexity and approximation of finding the longest vector sum (English)
0 references
27 September 2018
0 references
vector sum
0 references
finding a vector subset
0 references
inapproximability bound
0 references
approximation scheme
0 references
normed space
0 references
0 references
0 references
0 references
0.9526354074478148
0 references
0.8953009843826294
0 references
0.8923348188400269
0 references
0.8739245533943176
0 references
