Maximum Diversity Problem with Squared Euclidean Distance

Maximum Diversity Problem with Squared Euclidean Distance Full article

Journal

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

Output data

Year: 2019, Pages: 541-551 Pages count : 11 DOI: 10.1007/978-3-030-22629-9_38

Tags

Euclidean space; Exact algorithm; Fixed space dimension; Given size; Integer instance; Maximum variance; Pseudo-polynomial time; Strong NP-hardness; Subset of points

Authors

Eremeev Anton V. ^1,3 , Kel’manov Alexander V. ^1,2 , Kovalyov Mikhail Y. ⁴ , Pyatkin Artem V. ^1,2

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University
3	Dostoevsky Omsk State University
4	United Institute of Informatics Problems

Eremeev A.V. , Kel’manov A.V. , Kovalyov M.Y. , Pyatkin A.V.
Maximum Diversity Problem with Squared Euclidean Distance
Lecture Notes in Computer Science. 2019. P.541-551. DOI: 10.1007/978-3-030-22629-9_38 Scopus OpenAlex

Scopus:	2-s2.0-85067677029
OpenAlex:	W2952264269

DB	Citing
Scopus	10
OpenAlex	10