Pinning Down the Strong Wilber 1 Bound for Binary Search Trees

APPROX/RANDOM, 2019.

Other Links: arxiv.org|dblp.uni-trier.de|academic.microsoft.com

Abstract:

The famous dynamic optimality conjecture of Sleator and Tarjan from 1985 conjectures the existence of an $O(1)$-competitive algorithm for binary search trees (BST's). Even the simpler problem of (offline) approximation of the optimal cost of a BST for a given input, that we denote by $OPT$, is still widely open, with the best current al...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments