Two Constant-Factor-Optimal Realizations of Adaptive Heapsort.

Stefan Edelkamp Amr Elmasry Jyrki Katajainen

Published in: IWOCA (2011)

Keyphrases

constant factor
lower bound
approximation algorithms
worst case
upper bound
random variables
machine learning
learning algorithm
learning experience
sample complexity
data sets
e learning
optimal solution
active learning
branch and bound
approximation guarantees