Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Recoverable robust spanning tree problem under interval uncertainty
  representations   This paper deals with the recoverable robust spanning tree problem under
interval uncertainty representations. A polynomial time, combinatorial
algorithm for the recoverable spanning tree problem is first constructed. This
problem generalizes the incremental spanning tree problem, previously discussed
in literature. The algorithm built is then applied to solve the recoverable
robust spanning tree problem, under the traditional interval uncertainty
representation, in polynomial time. Moreover, the algorithm allows to obtain,
under some mild assumptions about the uncertainty intervals,several
approximation results for the recoverable robust spanning tree problem under
the Bertsimas and Sim interval uncertainty representation and the interval
uncertainty representation with a budget constraint.

4
The categories of this paper are: cond-mat
31
The categories of this paper are: ao-sci
8
The categories of this paper are: hep-ex
23
The categories of this paper are: solv-int
11
The categories of this paper are: hep-lat
26
The categories of this paper are: bayes-an
37
The categories of this paper are: supr-con
0
The categories of this paper are: hep-ph
27
The categories of this paper are: comp-gas
17
The categories of this paper are: q-fin
21
The categories of this paper are: adap-org
3
The categories of this paper are: physics
28
The categories of this paper are: alg-geom
20
The categories of this paper are: acc-phys
24
The categories of this paper are: dg-ga
30
The categories of this paper are: q-alg