Deutsche Nationalbibliothek
metadata only
Socially Fair Clustering: Parameterized Approximation and Local Search / Aditya Anand, Yury Makarychev, Liren Shan
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#799269
- Socially Fair Clustering: Parameterized Approximation and Local Search#797846
- Fast and effective algorithms for fair clustering at scale#180658
- Checking the Neighborhood: A Reply to DiPaolo & Behrends on Promotion#690001
- Datasets for "Watset: Local-global graph clustering with applications in sense and frame induction"#275019
Record · ID 1188639
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