Parameterized and Streaming Algorithms for Euclidean Fair k-Center Clustering

arXiv:2609.06384 · cs.LG, cs.AI · Submitted 2026-09-06 · Read on arXiv

cs.LG, cs.AI

Submitted: 2026-09-06

Updated: 2026-09-06

Journal ref: Proceedings of IJCAI 2026

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

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

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks