Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Competitive Online Search Trees on Trees   We consider the design of adaptive data structures for searching elements of
a tree-structured space. We use a natural generalization of the rotation-based
online binary search tree model in which the underlying search space is the set
of vertices of a tree. This model is based on a simple structure for
decomposing graphs, previously known under several names including elimination
trees, vertex rankings, and tubings. The model is equivalent to the classical
binary search tree model exactly when the underlying tree is a path. We
describe an online $O(\log \log n)$-competitive search tree data structure in
this model, matching the best known competitive ratio of binary search trees.
Our method is inspired by Tango trees, an online binary search tree algorithm,
but critically needs several new notions including one which we call
Steiner-closed search trees, which may be of independent interest. Moreover our
technique is based on a novel use of two levels of decomposition, first from
search space to a set of Steiner-closed trees, and secondly from these trees
into paths.

24
The categories of this paper are: dg-ga
6
The categories of this paper are: astro-ph
5
The categories of this paper are: gr-qc
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th
34
The categories of this paper are: chem-ph
19
The categories of this paper are: eess
0
The categories of this paper are: hep-ph
8
The categories of this paper are: hep-ex
33
The categories of this paper are: plasm-ph
15
The categories of this paper are: nucl-ex
18
The categories of this paper are: econ
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
26
The categories of this paper are: bayes-an
10
The categories of this paper are: q-bio