External Publication
Visit Post

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces

Theory of Computing Report May 7, 2026
Source

Authors: Michael T. M. Emmerich, Ksenia Pereverdieva, André Deutz

We study the computational complexity of exact cardinality-constrained minimum Riesz $s$-energy subset selection in finite metric spaces: given $n$ points, select $k

Discussion in the ATmosphere

Loading comments...