Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak. Pinning down the Strong Wilber 1 Bound for Binary Search Trees. In Jaroslaw Byrka, Raghu Meka, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference. Volume 176 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]
@inproceedings{ChalermsookCS20,
title = {Pinning down the Strong Wilber 1 Bound for Binary Search Trees},
author = {Parinya Chalermsook and Julia Chuzhoy and Thatchaphol Saranurak},
year = {2020},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.33},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.33},
researchr = {https://researchr.org/publication/ChalermsookCS20},
cites = {0},
citedby = {0},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference},
editor = {Jaroslaw Byrka and Raghu Meka},
volume = {176},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-164-1},
}