Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short
  proof of a 1.55 upper bound   Recently Byrka, Grandoni, Rothvoss and Sanita (at STOC 2010) gave a
1.39-approximation for the Steiner tree problem, using a hypergraph-based
linear programming relaxation. They also upper-bounded its integrality gap by
1.55. We describe a shorter proof of the same integrality gap bound, by
applying some of their techniques to a randomized loss-contracting algorithm.

4
The categories of this paper are: cond-mat
16
The categories of this paper are: stat
8
The categories of this paper are: hep-ex
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
21
The categories of this paper are: adap-org
28
The categories of this paper are: alg-geom
12
The categories of this paper are: nucl-th
13
The categories of this paper are: quant-ph
7
The categories of this paper are: hep-th
5
The categories of this paper are: gr-qc
30
The categories of this paper are: q-alg
18
The categories of this paper are: econ
19
The categories of this paper are: eess
27
The categories of this paper are: comp-gas
15
The categories of this paper are: nucl-ex