Faster Approximation Algorithm for the k-Regret Minimizing Set and Related Problems
From MaRDI portal
Publication:5232723
DOI10.1137/1.9781611975055.6zbMath1430.68452OpenAlexW2782288225MaRDI QIDQ5232723
Publication date: 12 September 2019
Published in: 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611975055.6
Related Items
Efficient processing of \(k\)-regret minimization queries with theoretical guarantees ⋮ Approximating Distance Measures for the Skyline