On Complexity of Searching a Subset of Vectors with Shortest Average under a Cardinality Restriction

On Complexity of Searching a Subset of Vectors with Shortest Average under a Cardinality Restriction Full article

Journal

Communications in Computer and Information Science
ISSN: 1865-0929

Output data

Year: 2017, Volume: 661, Pages: 51-57 Pages count : 7 DOI: 10.1007/978-3-319-52920-2_5

Tags

Euclidean norm; NP-hardness; Pseudo-polymonial time; Subset selection; Vectors sum

Authors

Eremeev Anton Valentinovich ^1,2 , Kelmanov A. ^3,4 , Pyatkin Artem Valerʹevich ^3,4

Affiliations

1	Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Sciences, Omsk, Russia
2	Omsk State University n.a. F.M. Dostoevsky, Omsk, Russia
3	Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Sciences
4	Novosibirsk State University

Eremeev A.V. , Kelmanov A. , Pyatkin A.V.
On Complexity of Searching a Subset of Vectors with Shortest Average under a Cardinality Restriction
Communications in Computer and Information Science. 2017. V.661. P.51-57. DOI: 10.1007/978-3-319-52920-2_5 Scopus OpenAlex

Scopus:	2-s2.0-85014263432
OpenAlex:	W2588598782

DB	Citing
Scopus	2
OpenAlex	3