On complexity of searching a subset of vectors with shortest average under a cardinality restriction › Research Explorer

Novosibirsk State University's Research Portal

On complexity of searching a subset of vectors with shortest average under a cardinality restriction

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Theoretical Cybernetics Section

DOI

https://doi.org/10.1007/978-3-319-52920-2_5
Final published version

Anton V. Eremeev
Alexander V. Kel’Manov
Artem V. Pyatkin

Original language	English
Title of host publication	Analysis of Images, Social Networks and Texts - 5th International Conference, AIST 2016, Revised Selected Papers
Editors	DI Ignatov, MY Khachay, VG Labunets, N Loukachevitch, SI Nikolenko, A Panchenko, AV Savchenko, K Vorontsov
Publisher	Springer-Verlag GmbH and Co. KG
Pages	51-57
Number of pages	7
ISBN (Print)	9783319529196
DOIs	https://doi.org/10.1007/978-3-319-52920-2_5
Publication status	Published - 1 Jan 2017
Event	5th International Conference on Analysis of Images, Social Networks and Texts, AIST 2016 - Yekaterinburg, Russian Federation Duration: 6 Apr 2016 → 8 Apr 2016

Publication series

Name	Communications in Computer and Information Science
Volume	661
ISSN (Print)	1865-0929

Conference

Conference	5th International Conference on Analysis of Images, Social Networks and Texts, AIST 2016
Country/Territory	Russian Federation
City	Yekaterinburg
Period	06.04.2016 → 08.04.2016

Research areas

Euclidean norm, NP-hardness, Pseudo-polymonial time, Subset selection, Vectors sum, CLUSTER-ANALYSIS

ID: 10278115