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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Annals of mathematics and artificial intelligence Ročník 90; číslo 7-9; s. 965 - 977
Hlavní autori:	Eremeev, Anton V., Kel’manov, Alexander V., Kovalyov, Mikhail Y., Pyatkin, Artem V.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.09.2022 Springer Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!