2 papers
cs.CG2026
On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
Michael T. M. Emmerich, Ksenia Pereverdieva, André Deutz
We study the computational complexity of exact cardinality-constrained minimum Riesz -energy subset selection in finite metric spaces: given points, select points of m…
cs.CG2026
Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
Michael T. M. Emmerich, Ksenia Pereverdieva, André H. Deutz
We prove that, for every fixed , selecting a subset of prescribed cardinality that maximizes the Solow--Polasky diversity indicator is NP-hard for finite point sets in $\mat…