A Tight Lower Bound for Selection in Sorted X+Y.
Michel CosnardAfonso FerreiraPublished in: ICCI (1991)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- worst case
- np hard
- optimal solution
- lower and upper bounds
- linear programming relaxation
- upper and lower bounds
- vc dimension
- branch and bound method
- lagrangian relaxation
- scheduling problem
- evolutionary algorithm
- machine learning
- data mining
- real world
- lower bounding
- active learning
- learning algorithm
- average case
- selection criteria
- competitive ratio
- data sets