Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An Optimal Rounding for Half-Integral Weighted Minimum Strongly
  Connected Spanning Subgraph   In the weighted minimum strongly connected spanning subgraph (WMSCSS) problem
we must purchase a minimum-cost strongly connected spanning subgraph of a
digraph. We show that half-integral linear program (LP) solutions for WMSCSS
can be efficiently rounded to integral solutions at a multiplicative $1.5$
cost. This rounding matches a known $1.5$ integrality gap lower bound for a
half-integral instance. More generally, we show that LP solutions whose
non-zero entries are at least a value $f > 0$ can be rounded at a
multiplicative cost of $2 - f$.

2
The categories of this paper are: math
34
The categories of this paper are: chem-ph
20
The categories of this paper are: acc-phys
37
The categories of this paper are: supr-con
33
The categories of this paper are: plasm-ph
36
The categories of this paper are: cmp-lg
25
The categories of this paper are: patt-sol
23
The categories of this paper are: solv-int
3
The categories of this paper are: physics
31
The categories of this paper are: ao-sci
29
The categories of this paper are: funct-an
32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
10
The categories of this paper are: q-bio
18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph