Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
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!
|
| _version_ | 1864130790068060161 |
|---|---|
| collection | WordPress RSS FRELIP Feed Integration |
| container_title | ArXiv cs.CG Recent Papers |
| description | |
| discipline_display | Engineering & Technology |
| discipline_facet | Engineering & Technology |
| format | Online Article RSS Article |
| genre | Journal Article |
| id | rss_article:48886 |
| institution | FRELIP |
| journal_source_facet | ArXiv cs.CG Recent Papers |
| publishDate | 2026 |
| publishDateSort | 2026 |
| record_format | rss_article |
| spellingShingle | Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane ArXiv cs.CG Recent Papers Aerospace & Aeronautical Engineering & Technology |
| sub_discipline_display | Aerospace & Aeronautical |
| sub_discipline_facet | Aerospace & Aeronautical |
| subject_display | ArXiv cs.CG Recent Papers Aerospace & Aeronautical Engineering & Technology ArXiv cs.CG Recent Papers Aerospace & Aeronautical Engineering & Technology |
| subject_facet | ArXiv cs.CG Recent Papers Aerospace & Aeronautical Engineering & Technology |
| title | Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane |
| title_auth | Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane |
| title_full | Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane |
| title_fullStr | Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane |
| title_full_unstemmed | Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane |
| title_short | Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane |
| title_sort | maximum solow--polasky diversity subset selection is np-hard even in the euclidean plane |
| topic | ArXiv cs.CG Recent Papers Aerospace & Aeronautical Engineering & Technology |
| url | https://arxiv.org/abs/2604.19484v1 |