A Unified Optimization Algorithm For Solving "Regret-Minimizing Representative" Problems
Summary: A unified optimization framework for RRMS variants replaces bespoke solvers with a single algorithm plus variant-specific oracles. It borrows k-medoids ideas and uses LP, sampling, and volume estimation to tailor oracles, with theory and experiments on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Suraj Shetiya
- 2. Abolfazl Asudeh
- 3. Sadia Ahmed
- 4. Gautam Das
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,253 | Happiness Maximizing Sets under Group Fairness Constraints | 2023 | VLDB | 4.3648789e-05 |
| 9,753 | Minimum Coresets for Maxima Representation of Multidimensional Data | 2021 | PODS | 4.2856385e-05 |
| 11,197 | rkHit: Representative Query with Uncertain Preference | 2023 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0015436578 |
| 1,070 | Regret-Minimizing Representative Databases | 2010 | VLDB | 0.00014274615 |
| 1,577 | Designing Fair Ranking Schemes | 2019 | SIGMOD | 0.00011276814 |
| 2,477 | Computing k-Regret Minimizing Sets | 2014 | VLDB | 8.6907684e-05 |
| 2,621 | Interactive Regret Minimization | 2012 | SIGMOD | 8.4408945e-05 |
| 2,936 | Answering Top-k Queries Using Views | 2006 | VLDB | 7.8579393e-05 |
| 5,113 | Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative | 2017 | SIGMOD | 5.6827696e-05 |
| 5,259 | Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality | 2018 | SIGMOD | 5.5972902e-05 |
| 5,558 | On Obtaining Stable Rankings | 2019 | VLDB | 5.4375292e-05 |
| 6,841 | Minimizing Average Regret Ratio in Database | 2016 | SIGMOD | 4.9057455e-05 |
| 8,132 | Discovering the Skyline of Web Databases | 2016 | VLDB | 4.5741104e-05 |
| 11,891 | Query Reranking As A Service | 2016 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,621 | Interactive Regret Minimization | 2012 | SIGMOD | 8.4408945e-05 |
| 8,521 | Computing A Well-Representative Summary of Conjunctive Query Results | 2024 | PODS | 4.4893996e-05 |
| 9,753 | Minimum Coresets for Maxima Representation of Multidimensional Data | 2021 | PODS | 4.2856385e-05 |
| 5,906 | k-Regret Queries with Nonlinear Utilities | 2015 | VLDB | 5.274596e-05 |
| 5,259 | Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality | 2018 | SIGMOD | 5.5972902e-05 |
| 6,841 | Minimizing Average Regret Ratio in Database | 2016 | SIGMOD | 4.9057455e-05 |
| 6,804 | RRR: Rank-Regret Representative | 2019 | SIGMOD | 4.917138e-05 |
| 1,070 | Regret-Minimizing Representative Databases | 2010 | VLDB | 0.00014274615 |
| 2,477 | Computing k-Regret Minimizing Sets | 2014 | VLDB | 8.6907684e-05 |
| 5,113 | Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative | 2017 | SIGMOD | 5.6827696e-05 |