An O(kn^2) dynamic program exactly maximizes Solow-Polasky diversity on ordered line metrics and monotone l1 staircases.
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
UNVERDICTED 1representative citing papers
citing papers explorer
-
Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
An O(kn^2) dynamic program exactly maximizes Solow-Polasky diversity on ordered line metrics and monotone l1 staircases.