On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum

On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum Full article

Journal

Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349

Output data

Year: 2017, Pages: 142-151 Pages count : 10 DOI: 10.1007/978-3-319-73013-4_13

Tags

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

Authors

Eremeev Anton V. ^1,2 , Kelmanov Alexander V. ^3,4 , Pyatkin Artem V. ^3,4 , Ziegler Igor A. ^1,2

Affiliations

1	Омский филиал ФГБУН «Институт математики им. С.Л. Соболева СО РАН».
2	Dostoevsky Omsk State University
3	Sobolev Institute of Mathematics
4	Novosibirsk State University

Eremeev A.V. , Kelmanov A.V. , Pyatkin A.V. , Ziegler I.A.
On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum
Lecture Notes in Computer Science. 2017. P.142-151. DOI: 10.1007/978-3-319-73013-4_13 Scopus OpenAlex

Scopus:	2-s2.0-85039428182
OpenAlex:	W2963435052

DB	Citing
Scopus	1
OpenAlex	3