Efficient Algorithms for k-Regret Minimizing Sets

DOI10.4230/LIPIcs.SEA.2017.7zbMath1432.68112arXiv1702.01446OpenAlexW2963960302MaRDI QIDQ4580150

Nirman Kumar, Stavros Sintos, Subhash Suri, Pankaj K. Agarwal

Publication date: 13 August 2018

Full work available at URL: https://arxiv.org/abs/1702.01446

zbMATH Keywords

hitting setskylinetop-\(k\) querycoresetregret-minimizing sets

Mathematics Subject Classification ID

Database theory (68P15) Approximation algorithms (68W25)

Related Items (4)

K-dominance in multidimensional data: theory and applications ⋮ Efficient processing of \(k\)-regret minimization queries with theoretical guarantees ⋮ Approximating Distance Measures for the Skyline ⋮ K-Dominance in Multidimensional Data: Theory and Applications

This page was built for publication: Efficient Algorithms for k-Regret Minimizing Sets