# Pinning Down the Strong Wilber 1 Bound for Binary Search Trees

@article{Chalermsook2019PinningDT, title={Pinning Down the Strong Wilber 1 Bound for Binary Search Trees}, author={Parinya Chalermsook and Julia Chuzhoy and Thatchaphol Saranurak}, journal={ArXiv}, year={2019}, volume={abs/1912.02900} }

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 algorithm achieving an $O(\log\log n)$-approximation. A major challenge in designing such algorithms is to obtain a tight lower bound on $OPT$ that is algorithm… CONTINUE READING

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 30 REFERENCES

## Upper Bounds for Maximally Greedy Binary Search Trees

VIEW 1 EXCERPT