Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Optimal Alphabetic Ternary Trees   We give a new algorithm to construct optimal alphabetic ternary trees, where
every internal node has at most three children. This algorithm generalizes the
classic Hu-Tucker algorithm, though the overall computational complexity has
yet to be determined.

6
The categories of this paper are: astro-ph
24
The categories of this paper are: dg-ga
37
The categories of this paper are: supr-con
22
The categories of this paper are: chao-dyn
21
The categories of this paper are: adap-org
35
The categories of this paper are: mtrl-th
15
The categories of this paper are: nucl-ex
33
The categories of this paper are: plasm-ph
8
The categories of this paper are: hep-ex
7
The categories of this paper are: hep-th
2
The categories of this paper are: math
0
The categories of this paper are: hep-ph
17
The categories of this paper are: q-fin
10
The categories of this paper are: q-bio
11
The categories of this paper are: hep-lat
4
The categories of this paper are: cond-mat