Composable Core-sets for Diversity and Coverage Maximization
Summary: Constructs small composable core-sets for multiple diversity-maximization objectives in metric spaces, achieving approximation ratios that nearly match best offline algorithms up to constant factors. Applies to distributed/streaming/MapReduce nearest-neighbor and diversity search, and proves impossibility for max-coverage–based diversity. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Piotr Indyk (Massachusetts Institute of Technology)
- 2. Sepideh Mahabadi (Massachusetts Institute of Technology)
- 3. Mohammad Mahdian (Google)
- 4. Vahab S. Mirrokni (Google)
BibTeX Citation
@inproceedings{indyk_pods14,
address = {New York, NY, USA},
series = {{PODS} '14},
title = {{Composable Core-sets for Diversity and Coverage Maximization}},
url = {https://dl.acm.org/doi/10.1145/2594538.2594560},
doi = {10.1145/2594538.2594560},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Indyk, Piotr and Mahabadi, Sepideh and Mahdian, Mohammad and Mirrokni, Vahab S.},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,460 | Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially | 2019 | VLDB | 6.5894687e-05 |
| 5,246 | MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension | 2017 | VLDB | 6.213078e-05 |
| 6,247 | RC-Index: Diversifying Answers to Range Queries | 2018 | VLDB | 5.8360766e-05 |
| 7,776 | Efficient Indexes for Diverse Top-k Range Queries | 2020 | PODS | 5.4546499e-05 |
| 7,957 | Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives | 2019 | PODS | 5.4183555e-05 |
| 10,852 | Fast and Private Max-Sum Diversification | 2026 | VLDB | 4.9793485e-05 |
| 11,081 | A Theoretical Framework for Distribution-Aware Dataset Search | 2025 | PODS | 4.9793485e-05 |
| 11,089 | Perfect Sampling in Turnstile Streams Beyond Small Moments | 2025 | PODS | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 456 | Mergeable Summaries | 2012 | PODS | 0.0001791284 |
| 1,145 | Efficient Diversity-Aware Search | 2011 | SIGMOD | 0.00011824078 |
| 1,729 | Addressing Diverse User Preferences in SQL-Query-Result Navigation | 2007 | SIGMOD | 9.7679275e-05 |
| 1,936 | Max-Sum Diversification, Monotone Submodular Functions and Dynamic Updates | 2012 | PODS | 9.3387282e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,850 | DisC Diversity: Result Diversification based on Dissimilarity and Coverage | 2013 | VLDB |
| 2 | 10,517 | Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation | 2026 | SIGMOD |
| 3 | 7,513 | Computing A Well-Representative Summary of Conjunctive Query Results | 2024 | PODS |
| 4 | 11,520 | Faster Algorithms for Fair Max-Min Diversification in Rd | 2024 | SIGMOD |
| 5 | 5,799 | Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem | 2017 | PODS |
| 6 | 1,936 | Max-Sum Diversification, Monotone Submodular Functions and Dynamic Updates | 2012 | PODS |
| 7 | 7,849 | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model | 2019 | PODS |
| 8 | 4,283 | Towards Tight Bounds for the Streaming Set Cover Problem | 2016 | PODS |
| 9 | 10,085 | Minimum Coresets for Maxima Representation of Multidimensional Data | 2021 | PODS |
| 10 | 5,246 | MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension | 2017 | VLDB |