Selecting a Maximum Solow-Polasky Diversity Subset in General Metric Spaces Is NP-hard
Michael T. M. Emmerich, Ksenia Pereverdieva, Andr\'e H. Deutz

TL;DR
This paper proves that selecting a maximum Solow-Polasky diversity subset in general metric spaces is NP-hard, highlighting the computational difficulty of optimizing diversity measures based on pairwise distances.
Contribution
The paper establishes NP-hardness of the subset selection problem for Solow-Polasky diversity in general metric spaces, using a novel reduction from the Independent Set problem.
Findings
NP-hardness holds for all fixed kernel parameters
The reduction uses a simple metric with only two non-zero distances
The proof involves a nontrivial nonlinear matrix inversion function
Abstract
The Solow--Polasky diversity indicator (or magnitude) is a classical measure of diversity based on pairwise distances. It has applications in ecology, conservation planning, and, more recently, in algorithmic subset selection and diversity optimization. In this note, we investigate the computational complexity of selecting a subset of fixed cardinality from a finite set so as to maximize the Solow--Polasky diversity value. We prove that this problem is NP-hard in general metric spaces. The reduction is from the classical Independent Set problem and uses a simple metric construction containing only two non-zero distance values. Importantly, the hardness result holds for every fixed kernel parameter ; equivalently, by rescaling the metric, one may fix the parameter to without loss of generality. A central point is that this is not a boilerplate reduction: because the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
