k-Center under Weak and Strong Distance Oracles with an Application to Minimum Sum of Radii Clustering
cs.DS
Submitted: 2026-10-30
Updated: 2026-10-30
Terminology
Sources
- Relative Error Fair Clustering in the Weak-Strong Oracle Model
- FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
- Metric $k$-clustering using only Weak Comparison Oracles
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time