A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort.
Rudolf FleischerPublished in: Algorithmica (1994)
Keyphrases
- lower bound
- worst case
- upper bound
- np hard
- branch and bound
- branch and bound algorithm
- average case
- greedy algorithm
- running times
- error bounds
- lower and upper bounds
- objective function
- upper and lower bounds
- visual attention
- lower bounding
- worst case analysis
- online algorithms
- constant factor
- additive error
- approximation algorithms
- sample size
- optimal solution
- data driven
- data sets
- lagrangian relaxation
- image segmentation
- genetic algorithm