1 citations · 1 across the 1 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Minimum Sum-of-Radii Clustering with Strong and Weak Oracles
Zachary Friggstad, Mahya Jamshidian, Ali Vakilian
In the minimum sum of radii (MSR) problem, the input is a set of points in a metric space and a parameter , and the goal is to cover the points by at most balls, each ce…
cs.DS2026
-Center under Weak and Strong Distance Oracles with an Application to Minimum Sum of Radii Clustering
Zachary Friggstad, Mahya Jamshidian, Ali Vakilian
In the weak-strong distance oracle model of Bateni, Dharangutte, Jayaram and Wang (COLT 2024), a metric on points is accessed through two oracles: a cheap weak oracle t…
cs.DS2024★ 1 cited
Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii
Zachary Friggstad, Mahya Jamshidian
In this paper, we present an improved approximation algorithm for three related problems. In the Minimum Sum of Radii clustering problem (MSR), we aim to select balls in a metr…