Approximating the min-max (regret) selecting items problem.

Adam Kasperski Adam Kurpisz Pawel Zielinski

Published in: Inf. Process. Lett. (2013)

Keyphrases

min max
multiobjective optimization
max min
lower bound
online learning
selection algorithm
worst case
expert advice
np hard
loss function
data mining
social networks
clustering algorithm
decision trees
least squares