Exact Sum-of-Radii Clustering under Any Constant Stability
cs.DS
Submitted: 2026-11-02
Updated: 2026-11-02
Terminology
Sources
- Improved fixed-parameter bounds for Min-Sum-Radii and Diameters $k$-clustering and their fair variants
- Clustering Graphs of Bounded Treewidth to Minimize the Sum of Radius-Dependent Costs
- FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
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