Minimum Coresets for Maxima Representation of Multidimensional Data
Summary: Introduce the minimum ε-coreset problem for maxima representation (preserving max inner products in any direction) and give an optimal polynomial-time algorithm in 2D via a reduction to the shortest directed cycle. Prove NP-hardness for d≥3, provide poly-time approximation algorithms for fixed d, and validate empirically on real and synthetic data. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yanhao Wang (University of Helsinki)
- 2. Michael Mathioudakis (University of Helsinki)
- 3. Yuchen Li (Singapore Management University)
- 4. Kian-Lee Tan (National University of Singapore)
BibTeX Citation
@inproceedings{wang_pods21,
address = {New York, NY, USA},
series = {{PODS} '21},
title = {{Minimum Coresets for Maxima Representation of Multidimensional Data}},
url = {https://dl.acm.org/doi/10.1145/3452021.3458322},
doi = {10.1145/3452021.3458322},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Wang, Yanhao and Mathioudakis, Michael and Li, Yuchen and Tan, Kian-Lee},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,393 | Happiness Maximizing Sets under Group Fairness Constraints | 2023 | VLDB | 5.2755515e-05 |
| 11,397 | rkHit: Representative Query with Uncertain Preference | 2023 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 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,072 | Regret-Minimizing Representative Databases | 2010 | VLDB | 0.0001230281 |
| 2,427 | Processing a Large Number of Continuous Preference Top-k Queries | 2012 | SIGMOD | 8.5915976e-05 |
| 4,727 | Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative | 2017 | SIGMOD | 6.5362946e-05 |
| 4,939 | Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality | 2018 | SIGMOD | 6.4336325e-05 |
| 6,786 | A Unified Optimization Algorithm For Solving “Regret-Minimizing Representative” Problems | 2020 | VLDB | 5.7740702e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,305 | Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation | 2026 | SIGMOD |
| 2 | 1,185 | Maximal Vector Computation in Large Data Sets | 2005 | VLDB |
| 3 | 6,786 | A Unified Optimization Algorithm For Solving “Regret-Minimizing Representative” Problems | 2020 | VLDB |
| 4 | 4,727 | Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative | 2017 | SIGMOD |
| 5 | 8,728 | Computing A Well-Representative Summary of Conjunctive Query Results | 2024 | PODS |
| 6 | 2,063 | Computing k-Regret Minimizing Sets | 2014 | VLDB |
| 7 | 10,173 | A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions | 2026 | PODS |
| 8 | 3,700 | Approximate MaxRS in Spatial Databases | 2013 | VLDB |
| 9 | 5,847 | MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension | 2017 | VLDB |
| 10 | 2,959 | Composable Core-sets for Diversity and Coverage Maximization | 2014 | PODS |