Maximizing Solow-Polasky diversity for a fixed-cardinality subset is NP-hard in general metric spaces.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Selecting a Maximum Solow-Polasky Diversity Subset in General Metric Spaces Is NP-hard
Maximizing Solow-Polasky diversity for a fixed-cardinality subset is NP-hard in general metric spaces.