Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
Saved in:
| Published in: | ArXiv cs.CG Recent Papers |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2026
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
- Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
- Local Depth-Based Corrections to Maxmin Landmark Selection for Lazy Witness Persistence
- Apple Peel Unfolding of Archimedean and Catalan Solids
- On the volume of the elliptope and related metric polytopes
- Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
- Peeling Rotten Potatoes for a Faster Approximation of Convex Cover