A Lower Bound for the Worst Case of Bottom-Up-Heapsort
Rudolf FleischerBhabani P. SinhaChristian UhrigPublished in: Inf. Comput. (1993)
Keyphrases
- lower bound
- worst case
- upper bound
- branch and bound algorithm
- np hard
- branch and bound
- optimal solution
- lower and upper bounds
- approximation algorithms
- greedy algorithm
- objective function
- vc dimension
- running times
- upper and lower bounds
- average case
- worst case analysis
- error bounds
- online algorithms
- lower bounding
- lagrangian relaxation
- data driven
- constant factor
- sample complexity
- competitive ratio
- linear programming relaxation
- branch and bound method
- additive error