arXiv (All)
open access
Rounding the Ball LP for Fair Max-Min Diversification
Given $n$ points in a metric space, partitioned into groups, $X_1,\dots,X_m$, and integer quotas, $k_1,\dots,k_m$, summing to $k$, the Fair Max-Min Diversification problem asks for a set of $k$ points, exactly $k_i$ from each group $X_i$, maximizing the minimum pairwise distance. Addanki et al. (ICD
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
- Large components in r ‐edge‐colorings of K n have diameter at most five#14347
- Quantile restrictions, revealed rankings, and the limits of multinomial choice#625269
- Quantile restrictions, revealed rankings, and the limits of multinomial choice#622996
- Duality between polyhedral approximation of value functions and optimal quantization of measures#1011003
- Partially Identified Rankings from Pairwise Interactions#1070661
Record · ID 1119342
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