Presents a polynomial-time s-t cut algorithm for minimum Riesz s-energy k-subset selection on ordered 1D points via Monge property and submodularity, extending to ℓ1-staircases.
hub
What energy functions can be minimized via graph cuts?
1 Pith paper cite this work, alongside 3,147 external citations. Polarity classification is still indexing.
1
Pith paper citing it
3,147
external citations · external index
hub tools
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polynomial-Time Riesz-Energy Subset Selection for Ordered Point Sets on Lines and $\ell_1$-Staircases
Presents a polynomial-time s-t cut algorithm for minimum Riesz s-energy k-subset selection on ordered 1D points via Monge property and submodularity, extending to ℓ1-staircases.