Selecting a subset of diverse points based on the squared euclidean distance Full article
Journal |
Annals of Mathematics and Artificial Intelligence
ISSN: 1012-2443 , E-ISSN: 1573-7470 |
||||||
---|---|---|---|---|---|---|---|
Output data | Year: 2022, Volume: 90, Number: 7-9, Pages: 965-977 Pages count : 13 DOI: 10.1007/s10472-021-09773-z | ||||||
Tags | Euclidean space; Exact algorithm; Fixed space dimension; Given size; Integer instance; Maximum variance; Pseudo-polynomial time; Strong NP-hardness; Subset of points | ||||||
Authors |
|
||||||
Affiliations |
|
Funding (2)
1 | Russian Foundation for Basic Research | 19-01-00308 |
2 |
Sobolev Institute of Mathematics Омский филиал ФГБУН «Институт математики им. С.Л. Соболева СО РАН». |
FWNF-2022 |
Cite:
Eremeev A.V.
, Kel’manov A.V.
, Kovalyov M.Y.
, Pyatkin A.V.
Selecting a subset of diverse points based on the squared euclidean distance
Annals of Mathematics and Artificial Intelligence. 2022. V.90. N7-9. P.965-977. DOI: 10.1007/s10472-021-09773-z WOS Scopus РИНЦ OpenAlex
Selecting a subset of diverse points based on the squared euclidean distance
Annals of Mathematics and Artificial Intelligence. 2022. V.90. N7-9. P.965-977. DOI: 10.1007/s10472-021-09773-z WOS Scopus РИНЦ OpenAlex
Dates:
Submitted: | Jul 31, 2020 |
Accepted: | Sep 10, 2021 |
Published online: | Sep 22, 2021 |
Published print: | Sep 1, 2022 |
Identifiers:
Web of science: | WOS:000698331900001 |
Scopus: | 2-s2.0-85115303593 |
Elibrary: | 47086647 |
OpenAlex: | W3200695282 |
Citing:
DB | Citing |
---|---|
OpenAlex | 1 |