Online algorithms for the maximum k-colorable subgraph problem.

Alain Hertz Romain Montagné François Gagnon

Published in: Comput. Oper. Res. (2018)

Keyphrases

online algorithms
online learning
lower bound
learning algorithm
average case
worst case
competitive ratio
np hard
asymptotically optimal
linear space
feature extraction
learning process
decision boundary