Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Polynomial-Time Approximation Schemes for Subset-Connectivity Problems
  in Bounded-Genus Graphs   We present the first polynomial-time approximation schemes (PTASes) for the
following subset-connectivity problems in edge-weighted graphs of bounded
genus: Steiner tree, low-connectivity survivable-network design, and subset
TSP. The schemes run in O(n log n) time for graphs embedded on both orientable
and non-orientable surfaces. This work generalizes the PTAS frameworks of
Borradaile, Klein, and Mathieu from planar graphs to bounded-genus graphs: any
future problems shown to admit the required structure theorem for planar graphs
will similarly extend to bounded-genus graphs.

15
The categories of this paper are: nucl-ex
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
37
The categories of this paper are: supr-con
7
The categories of this paper are: hep-th
11
The categories of this paper are: hep-lat
2
The categories of this paper are: math
30
The categories of this paper are: q-alg
34
The categories of this paper are: chem-ph
26
The categories of this paper are: bayes-an
33
The categories of this paper are: plasm-ph
24
The categories of this paper are: dg-ga
3
The categories of this paper are: physics
5
The categories of this paper are: gr-qc
6
The categories of this paper are: astro-ph
22
The categories of this paper are: chao-dyn