Minimum Riesz s-energy k-subset selection is NP-hard in Euclidean plane for variable s but solvable in O(n k^2) time by DP on rooted binary ultrametric trees.
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
ACCEPT 1representative citing papers
citing papers explorer
-
On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
Minimum Riesz s-energy k-subset selection is NP-hard in Euclidean plane for variable s but solvable in O(n k^2) time by DP on rooted binary ultrametric trees.