Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Deterministic approximation for the cover time of trees   We present a deterministic algorithm that given a tree T with n vertices, a
starting vertex v and a slackness parameter epsilon > 0, estimates within an
additive error of epsilon the cover and return time, namely, the expected time
it takes a simple random walk that starts at v to visit all vertices of T and
return to v. The running time of our algorithm is polynomial in n/epsilon, and
hence remains polynomial in n also for epsilon = 1/n^{O(1)}. We also show how
the algorithm can be extended to estimate the expected cover (without return)
time on trees.

24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
16
The categories of this paper are: stat
12
The categories of this paper are: nucl-th
17
The categories of this paper are: q-fin
33
The categories of this paper are: plasm-ph
0
The categories of this paper are: hep-ph
26
The categories of this paper are: bayes-an
13
The categories of this paper are: quant-ph
27
The categories of this paper are: comp-gas
6
The categories of this paper are: astro-ph
18
The categories of this paper are: econ
19
The categories of this paper are: eess
11
The categories of this paper are: hep-lat
36
The categories of this paper are: cmp-lg
8
The categories of this paper are: hep-ex