Splay trees on trees
Benjamin Aram Berendsohn, L\'aszl\'o Kozma

TL;DR
This paper extends the concept of Splay trees to tree-structured domains, providing approximation algorithms for optimal search trees and establishing a generalized Splay tree with static optimality in this broader setting.
Contribution
It introduces a method to approximate optimal search trees on trees and generalizes Splay trees to this setting, demonstrating their static optimality.
Findings
A $(1 + 1/t)$-approximation algorithm for optimal STTs with polynomial time complexity.
A broad family of STTs with linear rotation-distance is identified.
Generalized Splay trees satisfy a static optimality theorem, matching optimal STT costs asymptotically.
Abstract
Search trees on trees (STTs) are a far-reaching generalization of binary search trees (BSTs), allowing the efficient exploration of tree-structured domains. (BSTs are the special case in which the underlying domain is a path.) Trees on trees have been extensively studied under various guises in computer science and discrete mathematics. Recently Bose, Cardinal, Iacono, Koumoutsos, and Langerman (SODA 2020) considered adaptive STTs and observed that, apart from notable exceptions, the machinery developed for BSTs in the past decades does not readily transfer to STTs. In particular, they asked whether the optimal STT can be efficiently computed or approximated (by analogy to Knuth's algorithm for optimal BSTs), and whether natural self-adjusting BSTs such as Splay trees (Sleator, Tarjan, 1983) can be extended to this more general setting. We answer both questions affirmatively. First,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
