← 研踪 PaperTrailarXiv: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
摘要
We choose of sites to minimize Riesz -energy, in which a pair at distance contributes . For , 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 . To sharpen the bound, we start with a geometric packing. Farthest-first traversal gives centers separated by at least the last insertion distance . If one site of an optimum is removed, each of the remaining sites excludes at most one center closer than , leaving at least 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 , this reduces the representative bound from for a packing estimate of total energy to , independently of . Rational planar examples show that the resulting separation scale is sharp. A approximation on rational planar sites takes operations of polynomial bit cost. The observed number of representatives determines the search size . With one million sites, and , the exchange grid left 252 subsets on clustered inputs and about 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 , exact decision on metrics with nonzero distances in is W[1]-complete in . A gap that shrinks with 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
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-10 13:26 · 最新观测版本
Parameterized Complexity and Geometric Approximation of Riesz Energy Subset Selection
We choose of sites to minimize Riesz -energy, in which a pair at distance contributes . For , 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 . To sharpen the bound, we start with a geometric packing. Farthest-first traversal gives centers separated by at least the last insertion distance . If one site of an optimum is removed, each of the remaining sites excludes at most one center closer than , leaving at least 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 , this reduces the representative bound from for a packing estimate of total energy to , independently of . Rational planar examples show that the resulting separation scale is sharp. A approximation on rational planar sites takes operations of polynomial bit cost. The observed number of representatives determines the search size . With one million sites, and , the exchange grid left 252 subsets on clustered inputs and about 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 , exact decision on metrics with nonzero distances in is W[1]-complete in . A gap that shrinks with rules out a deterministic EPAS on unrestricted metrics unless FPT = W[1].
查看此版本解读 →查看此版本原文 ↗