Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Approximation Algorithms for the Traveling Repairman and Speeding
  Deliveryman Problems   Constant-factor, polynomial-time approximation algorithms are presented for
two variations of the traveling salesman problem with time windows. In the
first variation, the traveling repairman problem, the goal is to find a tour
that visits the maximum possible number of locations during their time windows.
In the second variation, the speeding deliveryman problem, the goal is to find
a tour that uses the minimum possible speedup to visit all locations during
their time windows. For both variations, the time windows are of unit length,
and the distance metric is based on a weighted, undirected graph. Algorithms
with improved approximation ratios are given for the case when the input is
defined on a tree rather than a general graph. The algorithms are also extended
to handle time windows whose lengths fall in any bounded range.

0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat
10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an
36
The categories of this paper are: cmp-lg
34
The categories of this paper are: chem-ph
6
The categories of this paper are: astro-ph
19
The categories of this paper are: eess
37
The categories of this paper are: supr-con
32
The categories of this paper are: atom-ph
20
The categories of this paper are: acc-phys
26
The categories of this paper are: bayes-an
22
The categories of this paper are: chao-dyn
8
The categories of this paper are: hep-ex
7
The categories of this paper are: hep-th
30
The categories of this paper are: q-alg