跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.13600 · v1

Parameterized Complexity and Geometric Approximation of Riesz Energy Subset Selection

首次提交 2026-11-10 13:26
版本更新 2026-11-10 13:26
雷达观测 2026-11-11 11:04
arXiv ↗PDF ↗

摘要

We choose kk of nn sites to minimize Riesz ss-energy, in which a pair at distance tt contributes t−st^{-s}. For s=2s=2, exact selection is polynomial on a line but NP-hard in the plane. Adapting the proxy lemma of Ceccarello et al. gives an efficient parameterized approximation scheme (EPAS) for fixed Euclidean dimension and fixed s>0s>0. To sharpen the bound, we start with a geometric packing. Farthest-first traversal gives 2k2k centers separated by at least the last insertion distance rr. If one site of an optimum is removed, each of the k−1k-1 remaining sites excludes at most one center closer than r/2r/2, leaving at least k+1k+1 centers free. The new step is a discrete exchange bound: the removed site's interaction energy is at most the average it would contribute at those free centers. In the plane at s=2s=2, this reduces the representative bound from O(k2log⁡(2k)/ε2)O(k^2\log(2k)/\varepsilon^2) for a packing estimate of total energy to O(klog⁡(2k)/ε2)O(k\log(2k)/\varepsilon^2), independently of nn. Rational planar examples show that the resulting separation scale r/log⁡(2k)r/\sqrt{\log(2k)} is sharp. A (1+ε)(1+\varepsilon) approximation on rational planar sites takes O(nk+nlog⁡n)+(Clog⁡(2k)/ε2)kO(nk+n\log n)+(C\log(2k)/\varepsilon^2)^k operations of polynomial bit cost. The observed number MM of representatives determines the search size (Mk)\binom{M}{k}. With one million sites, k=5k=5 and ε=1/2\varepsilon=1/2, the exchange grid left 252 subsets on clustered inputs and about 9.3×10269.3\times10^{26} on uniform inputs. The method extends to metrics of bounded doubling dimension and to compact domains with effective geometric routines, including filled simple polygons. At s=2s=2, exact decision on metrics with nonzero distances in {1,2}\{1,2\} is W[1]-complete in kk. A gap that shrinks with kk rules out a deterministic EPAS on unrestricted metrics unless FPT = W[1].

作者备注:35 pages, 6 figures. Code, data, and instructions for reproducing the experiments: https://github.com/emmerichmtm/PCGA-Riesz

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-10 13:26 · 最新观测版本

Parameterized Complexity and Geometric Approximation of Riesz Energy Subset Selection

We choose kk of nn sites to minimize Riesz ss-energy, in which a pair at distance tt contributes t−st^{-s}. For s=2s=2, exact selection is polynomial on a line but NP-hard in the plane. Adapting the proxy lemma of Ceccarello et al. gives an efficient parameterized approximation scheme (EPAS) for fixed Euclidean dimension and fixed s>0s>0. To sharpen the bound, we start with a geometric packing. Farthest-first traversal gives 2k2k centers separated by at least the last insertion distance rr. If one site of an optimum is removed, each of the k−1k-1 remaining sites excludes at most one center closer than r/2r/2, leaving at least k+1k+1 centers free. The new step is a discrete exchange bound: the removed site's interaction energy is at most the average it would contribute at those free centers. In the plane at s=2s=2, this reduces the representative bound from O(k2log⁡(2k)/ε2)O(k^2\log(2k)/\varepsilon^2) for a packing estimate of total energy to O(klog⁡(2k)/ε2)O(k\log(2k)/\varepsilon^2), independently of nn. Rational planar examples show that the resulting separation scale r/log⁡(2k)r/\sqrt{\log(2k)} is sharp. A (1+ε)(1+\varepsilon) approximation on rational planar sites takes O(nk+nlog⁡n)+(Clog⁡(2k)/ε2)kO(nk+n\log n)+(C\log(2k)/\varepsilon^2)^k operations of polynomial bit cost. The observed number MM of representatives determines the search size (Mk)\binom{M}{k}. With one million sites, k=5k=5 and ε=1/2\varepsilon=1/2, the exchange grid left 252 subsets on clustered inputs and about 9.3×10269.3\times10^{26} on uniform inputs. The method extends to metrics of bounded doubling dimension and to compact domains with effective geometric routines, including filled simple polygons. At s=2s=2, exact decision on metrics with nonzero distances in {1,2}\{1,2\} is W[1]-complete in kk. A gap that shrinks with kk rules out a deterministic EPAS on unrestricted metrics unless FPT = W[1].

查看此版本解读 →查看此版本原文 ↗