For large N the optimal dispersed subset consists of all points lying outside a self-consistently determined d-dimensional ball, with the entire distribution of maximal dispersion obtained via mean-field order statistics and the replica method.
Hochbaum et al.,A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem, European Journal of Operational Research323(2), 425-440 (2025)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cond-mat.stat-mech 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Most Dispersed Subset of Random Points in $\mathbb{R}^d$
For large N the optimal dispersed subset consists of all points lying outside a self-consistently determined d-dimensional ball, with the entire distribution of maximal dispersion obtained via mean-field order statistics and the replica method.