Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Approximating Sparse Covering Integer Programs Online   A covering integer program (CIP) is a mathematical program of the form: min
{c^T x : Ax >= 1, 0 <= x <= u, x integer}, where A is an m x n matrix, and c
and u are n-dimensional vectors, all having non-negative entries. In the online
setting, the constraints (i.e., the rows of the constraint matrix A) arrive
over time, and the algorithm can only increase the coordinates of vector x to
maintain feasibility. As an intermediate step, we consider solving the covering
linear program (CLP) online, where the integrality requirement on x is dropped.
  Our main results are (a) an O(log k)-competitive online algorithm for solving
the CLP, and (b) an O(log k log L)-competitive randomized online algorithm for
solving the CIP. Here k<=n and L<=m respectively denote the maximum number of
non-zero entries in any row and column of the constraint matrix A. By a result
of Feige and Korman, this is the best possible for polynomial-time online
algorithms, even in the special case of set cover.

33
The categories of this paper are: plasm-ph
23
The categories of this paper are: solv-int
14
The categories of this paper are: math-ph
4
The categories of this paper are: cond-mat
37
The categories of this paper are: supr-con
21
The categories of this paper are: adap-org
13
The categories of this paper are: quant-ph
7
The categories of this paper are: hep-th
32
The categories of this paper are: atom-ph
22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
18
The categories of this paper are: econ
9
The categories of this paper are: nlin
31
The categories of this paper are: ao-sci
15
The categories of this paper are: nucl-ex
12
The categories of this paper are: nucl-th