A Tight Lower Bound for Online Monotonic List Labeling.
Paul F. DietzJoel I. SeiferasJu ZhangPublished in: SIAM J. Discret. Math. (2004)
Keyphrases
- machine learning
- lower bound
- upper bound
- online algorithms
- active learning
- branch and bound algorithm
- branch and bound
- np hard
- online learning
- learning algorithm
- optimal solution
- worst case
- real time
- objective function
- lower bounding
- lower and upper bounds
- upper and lower bounds
- linear programming relaxation
- online environment
- competitive ratio
- collaborative learning
- sample complexity
- graph cuts
- neural network
- data sets