Maximum Solow-Polasky diversity subset selection of fixed size is NP-hard for Euclidean point sets in the plane.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
Maximum Solow-Polasky diversity subset selection of fixed size is NP-hard for Euclidean point sets in the plane.