Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Better Approximation Algorithms for Maximum Asymmetric Traveling
  Salesman and Shortest Superstring   In the maximum asymmetric traveling salesman problem (Max ATSP) we are given
a complete directed graph with nonnegative weights on the edges and we wish to
compute a traveling salesman tour of maximum weight. In this paper we give a
fast combinatorial $\frac 34$-approximation algorithm for Max ATSP. It is based
on a novel use of {\it half-edges}, matchings and a new method of edge
coloring. (A {\it half-edge} of edge $(u,v)$ is informally speaking "either a
head or a tail of $(u,v)$".) The current best approximation algorithms for Max
ATSP, achieving the approximation guarantee of $\frac 23$, are due to Kaplan,
Lewenstein, Shafrir and Sviridenko and Elbassioni, Paluch, van Zuylen. Using a
recent result by Mucha, which states that an $\alpha$-approximation algorithm
for Max ATSP implies a $(2+\frac{11(1-\alpha)}{9-2\alpha})$-approximation
algorithm for the shortest superstring problem (SSP), we obtain also a $(2
\frac{11}{30} \approx 2,3667)$-approximation algorithm for SSP, beating the
previously best known (having approximation factor equal to $2 \frac{11}{23}
\approx 2,4782$.)

3
The categories of this paper are: physics
15
The categories of this paper are: nucl-ex
21
The categories of this paper are: adap-org
7
The categories of this paper are: hep-th
18
The categories of this paper are: econ
27
The categories of this paper are: comp-gas
0
The categories of this paper are: hep-ph
35
The categories of this paper are: mtrl-th
32
The categories of this paper are: atom-ph
19
The categories of this paper are: eess
30
The categories of this paper are: q-alg
9
The categories of this paper are: nlin
14
The categories of this paper are: math-ph
4
The categories of this paper are: cond-mat
12
The categories of this paper are: nucl-th
8
The categories of this paper are: hep-ex