arXiv (All)
open access
Parameterized and Streaming Algorithms for Euclidean Fair $k$-Center Clustering
Motivated by the growing importance of fairness in machine learning, fair $k$-center clustering has attracted considerable research attention as a fundamental problem. In this problem, a dataset is partitioned into $m$ disjoint groups, and the objective is to select $k$ data points as centers, subje
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
- A Sub-4 Approximation for Fair $k$-Means#985378
- Competitive Random-Order Correlation k-Clustering#1130135
- Per-Query Gating of LLM Rerankers for Multi-Hop Retrieval#1037563
- From Fair Representation to Just Recognition in Generative AI#971852
- Stream Learning: Partition-Fair Gossip Learning Without Tokens#440339
Record · ID 973965
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