Complexity and algorithms for finding a subset of vectors with the longest sum (Q5920162)
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 algorithms for finding a subset of vectors with the longest sum |
scientific article; zbMATH DE number 6796747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and algorithms for finding a subset of vectors with the longest sum |
scientific article; zbMATH DE number 6796747 |
Statements
Complexity and algorithms for finding a subset of vectors with the longest sum (English)
0 references
23 October 2017
0 references
computational geometry
0 references
vector sum
0 references
normed space
0 references
APX-hardness
0 references
optimal solution
0 references
0.9837066531181335
0 references
0.925886332988739
0 references
0.9070417881011964
0 references
0.8953009843826294
0 references
0.8378465175628662
0 references
