Similar Items: Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
- On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
- Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
- The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem
- 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