Tight Coreset Bounds for Euclidean (k,z) -Clustering

arXiv:2610.34373 · cs.DS, cs.CG · Submitted 2026-10-25 · Read on arXiv

cs.DS, cs.CG

Submitted: 2026-10-25

Updated: 2026-10-25

Terminology

• Clustering — 1× in this paper · explained in 2 episodes

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Computational and Statistical Hardness of Calibration Distance
• Edge-Private Matching Kernels Through Local Decoding
• Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing