Streaming algorithms for robust max-min diversification
Given a set of $n$ points $X$ in a metric space and an integer $k$, max-min diversification aims to select $k$ points of $X$ maximizing their minimum pairwise distance. This objective function is however highly vulnerable to noisy points. In[Amagata, AAAI23], a robust formulation is proposed which addresses this vulner...
A. Pietracaprina, G. Pucci, Stefano Zanon
· 0 citations