On finding minimum cardinality subset of vectors with a constraint on the sum of squared euclidean pairwise distances › Research Explorer

Novosibirsk State University's Research Portal

On finding minimum cardinality subset of vectors with a constraint on the sum of squared euclidean pairwise distances

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

Theoretical Cybernetics Section

DOI

https://doi.org/10.1007/978-3-030-53552-0_6
Final published version

Anton V. Eremeev
Mikhail Y. Kovalyov
Artem V. Pyatkin

Original language	English
Title of host publication	Learning and Intelligent Optimization - 14th International Conference, LION 14, 2020, Revised Selected Papers
Editors	Ilias S. Kotsireas, Panos M. Pardalos
Publisher	Springer Gabler
Pages	40-45
Number of pages	6
ISBN (Print)	9783030535513
DOIs	https://doi.org/10.1007/978-3-030-53552-0_6
Publication status	Published - 1 Jul 2020
Event	14th International Conference on Learning and Intelligent Optimization, LION 2020 - Athens, Greece Duration: 24 May 2020 → 28 May 2020

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12096 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	14th International Conference on Learning and Intelligent Optimization, LION 2020
Country/Territory	Greece
City	Athens
Period	24.05.2020 → 28.05.2020

Research areas

Euclidean space, Exact algorithm, Integer instance, NP-hardness, Pseudo-polynomial time, Subset of points

ID: 24962158