Given a point set $ P\subseteq M $ from a metric space $(M, d) $ and numbers $ k, z\in N $,
the* metric $ k $-center problem with $ z $ outliers* is to find a set $ C^\ast\subseteq P $ of …

Given a point set P⊆ X of size n in a metric space (X, dist) of doubling dimension d and two
parameters k∈ ℕ and z∈ ℕ, the k-center problem with z outliers asks to return a set …

Given a set of points P, the k-center problem is to find a minimum radius r* and associated
center set of k points C such that the distance from each point in P to its closest center is at …

The metric $ k $-center clustering problem with $ z $ outliers, also known as $(k, z) $-center
clustering, involves clustering a given point set $ P $ in a metric space $(M, d) $ using at …

In this work, cover trees are the main focus, and they serve as a data structure to efficiently
store metric data. We utilize them for dynamically handling the k-center problem, both with …

La ricerca del vicino più vicino (Nearest Neighbor Search, NNS) rappresenta un pilastro
fondamentale per applicazioni di intelligenza artificiale e sistemi di recupero informazioni …