22 citations · 23 across the 2 of their papers we have counts for
2 papers
cs.DS2017★ 22 cited
Efficient Algorithms for k-Regret Minimizing Sets
Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos +1
A regret minimizing set Q is a small size representation of a much larger database P so that user queries executed on Q return answers whose scores are not much worse than those on…
cs.CG2013★ 1 cited
Approximating Minimization Diagrams and Generalized Proximity Search
Sariel Har-Peled, Nirman Kumar
We investigate the classes of functions whose minimization diagrams can be approximated efficiently in \Re^d. We present a general framework and a data-structure that can be used t…