On complexity of the problem of choosing a vector subset with maximal sum length (Q3115204)
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 6007844
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On complexity of the problem of choosing a vector subset with maximal sum length |
scientific article; zbMATH DE number 6007844 |
Statements
20 February 2012
0 references
sum of vectors
0 references
complexity
0 references
NP-completeness
0 references
0.8863698244094849
0 references
0.8790821433067322
0 references
0.8538906574249268
0 references
0.8484218716621399
0 references
