Research map / Learning theory and algorithms / Fairness
How to Solve Fair k-Center in Massive Data Models
Ashish Chiplunkar, Sagar Kale, Sivaramakrishnan Natarajan Ramamoorthy
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the two-pass streaming algorithm instead of the strongest baseline | Fair k-center · CelebA, capacities [2, 2] | cost / Gonzalez's lower bound: 1.85 -> 1.76 | Improved |
| Use the two-pass streaming algorithm instead of the strongest baseline | Fair k-center · SushiA, capacities [2, 2] | cost / Gonzalez's lower bound: 2.18 -> 2.0 | Improved |
| Use the two-pass streaming algorithm instead of the strongest baseline | Fair k-center · SushiA, capacities [2] * 12 | cost / Gonzalez's lower bound: 2.0 -> 2.4 | Hurt |
| Use the two-pass streaming algorithm instead of the strongest baseline | Fair k-center · Adult, capacities [2, 2] | cost / Gonzalez's lower bound: 2.04 -> 1.9 | Improved |
| Use the distributed algorithm instead of the strongest baseline | Fair k-center · SushiA, capacities [2] * 6 | cost / Gonzalez's lower bound: 2.24 -> 2.24 | No clear effect |
| Use the distributed algorithm instead of the strongest baseline | Fair k-center · Adult, capacities [2] * 10 | cost / Gonzalez's lower bound: 2.41 -> 2.75 | Hurt |
| Run the two-pass algorithm on the 100 GB synthetic dataset | Fair k-center · 100 GB synthetic dataset | running time: 1.95 hours; 1.07 hours | Mixed |
Closest papers by meaning
- Improved Streaming Algorithm for Fair k-Center Clustering (AAAI 2026 · similarity 0.91)
- Fair k-Center Clustering for Data Summarization (ICML 2019 · similarity 0.89)
- Fair Clustering in the Sliding Window Model (ICLR 2025 · similarity 0.86)
- Fully-Scalable Massively Parallel Algorithm for k-center with Outliers (AAAI 2025 · similarity 0.86)
- Proportional Fairness in Non-Centroid Clustering (NeurIPS 2024 · similarity 0.84)
- Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems (ICLR 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
