Approximability of the problem of finding a vector subset with the longest sum (Q4973237)
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: Approximability of the problem of finding a vector subset with the longest sum |
scientific article; zbMATH DE number 7139173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximability of the problem of finding a vector subset with the longest sum |
scientific article; zbMATH DE number 7139173 |
Statements
Approximability of the Problem of Finding a Vector Subset with the Longest Sum (English)
0 references
2 December 2019
0 references
sum vector
0 references
search of a vector subset
0 references
approximation algorithm
0 references
inapproximability bound
0 references
0.8739245533943176
0 references
0.8624167442321777
0 references
0.8466694355010986
0 references
0.8378465175628662
0 references
0.8208823800086975
0 references
