Fair Diversity Maximization via Local Search
This work presents a new local-search framework that yields a $4-approximation for any constant number of groups, with no restrictions on the metric space or on the size of the selected set, and is the first constant-factor approximation whose guarantee is independent of the number of groups in this general setting.