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

Anton V. Eremeev, Alexander V. Kel'manov, Artem V. Pyatkin. On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction. In Dmitry I. Ignatov, Mikhail Yu. Khachay, Valeri G. Labunets, Natalia V. Loukachevitch, Sergey I. Nikolenko, Alexander Panchenko, Andrey V. Savchenko, Konstantin Vorontsov, editors, Analysis of Images, Social Networks and Texts - 5th International Conference, AIST 2016, Yekaterinburg, Russia, April 7-9, 2016, Revised Selected Papers. Volume 661 of Communications in Computer and Information Science, pages 51-57, 2016. [doi]

Abstract

Abstract is missing.