arXiv (All)
open access
Socially Fair Clustering: Parameterized Approximation and Local Search
We study the Socially Fair Clustering problem introduced by Abbasi, Bhaskara, and Venkatasubramanian (2021) and Ghadiri, Samadi, and Vempala (2021), along with its extension, the $(p,q)$-Socially Fair Clustering problem. This problem generalizes $k$-medians and $k$-means to settings where data point
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Socially Fair Clustering: Parameterized Approximation and Local Search#797846
- Checking the Neighborhood: A Reply to DiPaolo & Behrends on Promotion#690001
- Non-Local Search-to-Decision Reduction over F2, and More#1130610
- The Remaining $K_4$-Free Case in the Multipartite Clique Problem#1013778
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling#973974
Record · ID 799269
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive