Tight lower bounds for online labeling problem
Jan BulánekMichal KouckýMichael E. SaksPublished in: CoRR (2011)
Keyphrases
- lower bound
- upper bound
- online algorithms
- branch and bound
- np hard
- worst case
- online learning
- branch and bound algorithm
- objective function
- active learning
- lower bounding
- upper and lower bounds
- optimal solution
- randomly generated problems
- real time
- image labeling
- quadratic assignment problem
- social networks
- lower and upper bounds
- online communities
- image segmentation
- max sat
- training data
- optimal cost
- labeling process