Faster Algorithms for Fair Max-Min Diversification in Rd
Summary: First constant-factor approximation for FairDiv in near-linear time and linear space. Key ideas: MWU + geometric data structures to implicitly/approximately solve LP; coreset yields first distribution-independent streaming algorithm, with strong million-scale empirical performance. (summarized by gpt-5.4-mini on May 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yash Kurkure
- 2. Miles Shamo
- 3. Joseph Wiseman
- 4. Sainyam Galhotra
- 5. Stavros Sintos
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,521 | Computing A Well-Representative Summary of Conjunctive Query Results | 2024 | PODS | 4.4893996e-05 |
| 10,002 | Clustering with Set Outliers and Applications in Relational Clustering | 2026 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,717 | Max-Sum Diversification, Monotone Submodular Functions and Dynamic Updates | 2012 | PODS | 0.00010768447 |
| 8,921 | Efficient Indexes for Diverse Top-k Range Queries | 2020 | PODS | 4.4229886e-05 |
Previous
Page 1 / 1
Next