Tight lower bounds for the online labeling problem.
Jan BulánekMichal KouckýMichael E. SaksPublished in: STOC (2012)
Keyphrases
- lower bound
- upper bound
- online algorithms
- branch and bound
- branch and bound algorithm
- online learning
- np hard
- worst case
- lower and upper bounds
- objective function
- active learning
- real time
- upper and lower bounds
- lower bounding
- quadratic assignment problem
- image labeling
- image segmentation
- unsupervised learning
- linear programming relaxation
- max sat
- learning environment
- optimal solution
- online environment