Parameterized Complexity and Geometric Approximation of Riesz Energy Subset Selection
cs.CG, cs.CC, cs.DS
Submitted: 2026-11-10
Updated: 2026-11-10
Code: https://github.com/emmerichmtm/PCGA-Riesz
Terminology
Sources
- On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
- Polynomial-Time Riesz-Energy Subset Selection for Ordered Point Sets on Lines and $\ell_1$-Staircases
Related papers
- The Rhythm of the Tiles: Narrow and Low Temperature Computation and Simulation in Synchronous Tile Self-Assembly
- k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
- Covering Points with Rectangular Boundaries
- Tiling 3D Space by (Translates of) a Single Polycube is Undecidable
- Quadratic Complexity of Voronoi Diagrams in R cubed for Lines in a Single Ruling of a Regulus
- Minimum central circles: chain order, seam obstructions, and exact finite certification