Maximum Solow-Polasky diversity subset selection of fixed size is NP-hard for Euclidean point sets in the plane.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CG 2years
2026 2representative citing papers
Maximizing Solow-Polasky diversity for a fixed-cardinality subset is NP-hard in general metric spaces.
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.
-
Selecting a Maximum Solow-Polasky Diversity Subset in General Metric Spaces Is NP-hard
Maximizing Solow-Polasky diversity for a fixed-cardinality subset is NP-hard in general metric spaces.