Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Covering selfish machines   We consider the machine covering problem for selfish related machines. For a
constant number of machines, m, we show a monotone polynomial time
approximation scheme (PTAS) with running time that is linear in the number of
jobs. It uses a new technique for reducing the number of jobs while remaining
close to the optimal solution. We also present an FPTAS for the classical
machine covering problem (the previous best result was a PTAS) and use this to
give a monotone FPTAS.
  Additionally, we give a monotone approximation algorithm with approximation
ratio \min(m,(2+\eps)s_1/s_m) where \eps>0 can be chosen arbitrarily small and
s_i is the (real) speed of machine i. Finally we give improved results for two
machines.
  Our paper presents the first results for this problem in the context of
selfish machines.

26
The categories of this paper are: bayes-an
2
The categories of this paper are: math
10
The categories of this paper are: q-bio
17
The categories of this paper are: q-fin
0
The categories of this paper are: hep-ph
28
The categories of this paper are: alg-geom
25
The categories of this paper are: patt-sol
18
The categories of this paper are: econ
11
The categories of this paper are: hep-lat
19
The categories of this paper are: eess
16
The categories of this paper are: stat
8
The categories of this paper are: hep-ex
9
The categories of this paper are: nlin
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
15
The categories of this paper are: nucl-ex