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
- 2. Michael Mathioudakis
- 3. Yuchen Li
- 4. Kian-Lee Tan
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,246 | Happiness Maximizing Sets under Group Fairness Constraints | 2023 | VLDB | 4.3690661e-05 |
| 11,195 | rkHit: Representative Query with Uncertain Preference | 2023 | SIGMOD | 4.1945683e-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.00014270817 |
| 2,976 | Processing a Large Number of Continuous Preference Top-k Queries | 2012 | SIGMOD | 7.789303e-05 |
| 5,116 | Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative | 2017 | SIGMOD | 5.6830089e-05 |
| 5,255 | Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality | 2018 | SIGMOD | 5.6013035e-05 |
| 6,834 | A Unified Optimization Algorithm For Solving "Regret-Minimizing Representative" Problems | 2020 | VLDB | 4.9117328e-05 |
Previous
Page 1 / 1
Next