Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Covering Points by Disjoint Boxes with Outliers   For a set of n points in the plane, we consider the axis--aligned (p,k)-Box
Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together
contain n-k points. In this paper, we consider the boxes to be either squares
or rectangles, and we want to minimize the area of the largest box. For general
p we show that the problem is NP-hard for both squares and rectangles. For a
small, fixed number p, we give algorithms that find the solution in the
following running times:
  For squares we have O(n+k log k) time for p=1, and O(n log n+k^p log^p k time
for p = 2,3. For rectangles we get O(n + k^3) for p = 1 and O(n log n+k^{2+p}
log^{p-1} k) time for p = 2,3.
  In all cases, our algorithms use O(n) space.

7
The categories of this paper are: hep-th
31
The categories of this paper are: ao-sci
32
The categories of this paper are: atom-ph
11
The categories of this paper are: hep-lat
35
The categories of this paper are: mtrl-th
16
The categories of this paper are: stat
9
The categories of this paper are: nlin
15
The categories of this paper are: nucl-ex
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th
13
The categories of this paper are: quant-ph
19
The categories of this paper are: eess
4
The categories of this paper are: cond-mat
5
The categories of this paper are: gr-qc
3
The categories of this paper are: physics
2
The categories of this paper are: math