Search Results for author:
Found 1 papers, 0 papers with code
Rank-Regret Minimization
Thus it considered the problem of finding the minimal set $S$ with a rank-regret (the rank of top-1 tuple of $S$ in the sorted list of $D$) at most $k$, called the rank-regret representative (RRR) problem.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
