On Searching Sorted Lists: A Near-Optimal Lower Bound
Paul BeameFaith E. FichPublished in: Electron. Colloquium Comput. Complex. (1998)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- branch and bound
- np hard
- lower and upper bounds
- optimal solution
- linear programming relaxation
- lagrangian relaxation
- artificial intelligence
- worst case
- polynomial approximation
- real time
- constant factor
- lower bounding
- online algorithms
- computational complexity
- social networks
- databases