Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Asymptotic Optimality of the Greedy Patching Heuristic for Max TSP in
  Doubling Metrics   The maximum traveling salesman problem (Max~TSP) consists of finding a
Hamiltonian cycle with the maximum total weight of the edges in a given
complete weighted graph. We prove that, in the case when the edge weights are
induced by a metric space of bounded doubling dimension, asymptotically optimal
solutions of the problem can be found by the simple greedy patching heuristic.
Taking as a start point a maximum-weight cycle cover, this heuristic
iteratively patches pairs of its cycles into one minimizing the weight loss at
each step.

26
The categories of this paper are: bayes-an
5
The categories of this paper are: gr-qc
16
The categories of this paper are: stat
23
The categories of this paper are: solv-int
37
The categories of this paper are: supr-con
9
The categories of this paper are: nlin
36
The categories of this paper are: cmp-lg
27
The categories of this paper are: comp-gas
33
The categories of this paper are: plasm-ph
24
The categories of this paper are: dg-ga
19
The categories of this paper are: eess
29
The categories of this paper are: funct-an
25
The categories of this paper are: patt-sol
12
The categories of this paper are: nucl-th
10
The categories of this paper are: q-bio
31
The categories of this paper are: ao-sci