Search Results for author:
Found 1 papers, 0 papers with code
Coreset-based Strategies for Robust Center-type Problems
Given a dataset $V$ of points from some metric space, the popular $k$-center problem requires to identify a subset of $k$ points (centers) in $V$ minimizing the maximum distance of any point of $V$ from its closest center.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
