Selecting a subset of diverse points based on the squared euclidean distance

In this paper we consider two closely related problems of selecting a diverse subset of points with respect to squared Euclidean distance. Given a set of points in Euclidean space, the first problem is to find a subset of a specified size M maximizing the sum of squared Euclidean distances between t...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of mathematics and artificial intelligence Vol. 90; no. 7-9; pp. 965 - 977
Main Authors:	Eremeev, Anton V., Kel’manov, Alexander V., Kovalyov, Mikhail Y., Pyatkin, Artem V.
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.09.2022 Springer Springer Nature B.V
Subjects:	Algorithms Approximation Artificial Intelligence Complex Systems Complexity Computer Science Dynamic programming Euclidean geometry Euclidean space Hardness Integer programming Mathematics Optimization Polynomials S702: Lion14 Strong NP-hardness Given size Maximum variance Pseudo-polynomial time 62H30 Euclidean space Integer instance Fixed space dimension 68W25 Subset of points Exact algorithm 90C09
ISSN:	1012-2443, 1573-7470
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!