On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances

On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances Full article

Journal

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

Output data

Year: 2020, Pages: 40-45 Pages count : 6 DOI: 10.1007/978-3-030-53552-0_6

Tags

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

Authors

Eremeev Anton V. ¹ , Kovalyov Mikhail Y. ³ , Pyatkin Artem V. ^2,4

Affiliations

1	Sobolev Institute of Mathematics, Novosibirsk, Russian Federation
2	Novosibirsk State University
3	United Institute of Informatics Problems
4	Sobolev Institute of Mathematics, Novosibirsk, Russian Federation

Eremeev A.V. , Kovalyov M.Y. , Pyatkin A.V.
On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances
Lecture Notes in Computer Science. 2020. P.40-45. DOI: 10.1007/978-3-030-53552-0_6 Scopus OpenAlex

Scopus:	2-s2.0-85089211896
OpenAlex:	W3042461818

DB	Citing
Scopus	1
OpenAlex	1