Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Improved Approximation Algorithms for the Min-Max Selecting Items
  Problem   We give a simple deterministic $O(\log K / \log\log K)$ approximation
algorithm for the Min-Max Selecting Items problem, where $K$ is the number of
scenarios. While our main goal is simplicity, this result also improves over
the previous best approximation ratio of $O(\log K)$ due to Kasperski, Kurpisz,
and Zieli\'nski (Information Processing Letters (2013)). Despite using the
method of pessimistic estimators, the algorithm has a polynomial runtime also
in the RAM model of computation. We also show that the LP formulation for this
problem by Kasperski and Zieli\'nski (Annals of Operations Research (2009)),
which is the basis for the previous work and ours, has an integrality gap of at
least $\Omega(\log K / \log\log K)$.

33
The categories of this paper are: plasm-ph
10
The categories of this paper are: q-bio
14
The categories of this paper are: math-ph
20
The categories of this paper are: acc-phys
34
The categories of this paper are: chem-ph
15
The categories of this paper are: nucl-ex
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
12
The categories of this paper are: nucl-th
18
The categories of this paper are: econ
3
The categories of this paper are: physics
7
The categories of this paper are: hep-th
4
The categories of this paper are: cond-mat
27
The categories of this paper are: comp-gas
37
The categories of this paper are: supr-con
19
The categories of this paper are: eess