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

DOI10.1007/s10472-021-09773-zzbMath1493.62380OpenAlexW3200695282WikidataQ114227641 ScholiaQ114227641MaRDI QIDQ2163859

Mikhail Y. Kovalyov, Alexander Kel'Manov, Artem V. Pyatkin, Anton Valentinovich Eremeev

Publication date: 11 August 2022

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-021-09773-z

zbMATH Keywords

strong NP-hardnessexact algorithmeuclidean spacepseudo-polynomial timemaximum variancefixed space dimensiongiven sizeinteger instancesubset of points

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Boolean programming (90C09) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Composing medical crews with equity and efficiency
• Some easy and some not so easy geometric optimization problems
• Maximum diversity problem with squared Euclidean distance
• Differential evolution with enhanced diversity maintenance
• Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems
• Solving some vector subset problems by Voronoi diagrams
• Max-sum diversity via convex programming
• Finding k points with minimum diameter and related problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• An approximation scheme for a problem of search for a vector subset
• An FPTAS for a vector subset search problem

This page was built for publication: Selecting a subset of diverse points based on the squared Euclidean distance