Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Optimal top dag compression   It is shown that for a given ordered node-labelled tree of size $n$ and with
$s$ many different node labels, one can construct in linear time a top dag of
height $O(\log n)$ and size $O(n / \log_\sigma n) \cap O(d \cdot \log n)$,
where $\sigma = \max\{ 2, s\}$ and $d$ is the size of the minimal dag. The size
bound $O(n / \log_\sigma n)$ is optimal and improves on previous bounds.

11
The categories of this paper are: hep-lat
3
The categories of this paper are: physics
25
The categories of this paper are: patt-sol
10
The categories of this paper are: q-bio
19
The categories of this paper are: eess
18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph
8
The categories of this paper are: hep-ex
23
The categories of this paper are: solv-int
37
The categories of this paper are: supr-con
16
The categories of this paper are: stat
13
The categories of this paper are: quant-ph
24
The categories of this paper are: dg-ga
15
The categories of this paper are: nucl-ex
28
The categories of this paper are: alg-geom
34
The categories of this paper are: chem-ph