Maximum diversity problem with squared Euclidean distance

DOI10.1007/978-3-030-22629-9_38zbMath1446.90160OpenAlexW2952264269MaRDI QIDQ2181789

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

Publication date: 19 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-22629-9_38

zbMATH Keywords

Euclidean spacestrong NP-hardnessexact algorithmpseudo-polynomial timemaximum variancefixed space dimensiongiven sizeinteger instancesubset of points

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Erd?s problems and related topics of discrete geometry (52C10) Euclidean geometries (general) and generalizations (51M05)

Related Items (5)

Selecting a subset of diverse points based on the squared Euclidean distance ⋮ Maximizing single attribute diversity in group selection ⋮ An exact cutting plane method for the Euclidean max-sum diversity problem ⋮ \(t\)-linearization for the maximum diversity problem ⋮ Easy NP-hardness Proofs of Some Subset Choice Problems

This page was built for publication: Maximum diversity problem with squared Euclidean distance