Lower bounds for randomized algorithms for online chain partitioning.

Claire Mathieu Olga Ohrimenko

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

Keyphrases

randomized algorithms
lower bound
upper bound
online algorithms
branch and bound
online learning
branch and bound algorithm
np hard
randomized algorithm
worst case
lower and upper bounds
objective function
approximation algorithms
linear programming relaxation
optimal solution
dynamic programming
constant factor