Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Improved Lower Bound for Competitive Graph Exploration   We give an improved lower bound of 10/3 on the competitive ratio for the
exploration of an undirected, edge-weighted graph with a single agent that
needs to return to the starting location after visiting all vertices. We assume
that the agent has full knowledge of all edges incident to visited vertices,
and, in particular, vertices have unique identifiers. Our bound improves a
lower bound of 2.5 by Dobrev et al. [SIROCCO'12] and also holds for planar
graphs, where it complements an upper bound of 16 by Kalyanasundaram and
Pruhs[TCS'94]. The question whether a constant competitive ratio can be
achieved in general remains open.

32
The categories of this paper are: atom-ph
33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
12
The categories of this paper are: nucl-th
34
The categories of this paper are: chem-ph
0
The categories of this paper are: hep-ph
26
The categories of this paper are: bayes-an
23
The categories of this paper are: solv-int
14
The categories of this paper are: math-ph
3
The categories of this paper are: physics
7
The categories of this paper are: hep-th
30
The categories of this paper are: q-alg
5
The categories of this paper are: gr-qc
22
The categories of this paper are: chao-dyn
36
The categories of this paper are: cmp-lg
21
The categories of this paper are: adap-org