Computing optimal k-regret minimizing sets with top-k depth contours

Sean Chester Alex Thomo S. Venkatesh Sue Whitesides

Published in: CoRR (2012)

Keyphrases

worst case
dynamic programming
query processing
efficiently computing
optimal solution
lower bound
game theory
candidate set
regret bounds
three dimensional
np hard
least squares
closed form
depth information
convex functions
minimax regret