Tight Lower Bounds for the Online Labeling Problem.
Jan BulánekMichal KouckýMichael E. SaksPublished in: SIAM J. Comput. (2015)
Keyphrases
- lower bound
- upper bound
- online algorithms
- branch and bound
- worst case
- branch and bound algorithm
- online learning
- objective function
- optimal solution
- active learning
- lower bounding
- real time
- upper and lower bounds
- randomly generated problems
- lower and upper bounds
- np hard
- image segmentation
- vc dimension
- linear programming relaxation
- semi supervised
- image labeling
- optimal cost
- data sets