Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On Undecided LP, Clustering and Active Learning   We study colored coverage and clustering problems. Here, we are given a
colored point set where the points are covered by (unknown) $k$ clusters, which
are monochromatic (i.e., all the points covered by the same cluster, have the
same color). The access to the colors of the points (or even the points
themselves) is provided indirectly via various queries (such as nearest
neighbor, or separation queries). We show that if the number of clusters is a
constant, then one can correctly deduce the color of all the points (i.e.,
compute a monochromatic clustering of the points) using a polylogarithmic
number of queries.
  We investigate several variants of this problem, including Undecided Linear
Programming, covering of points by $k$ monochromatic balls, covering by $k$
triangles/simplices, and terrain simplification. For the later problem, we
present the first near linear time approximation algorithm. While our
approximation is slightly worse than previous work, this is the first algorithm
to have subquadratic complexity if the terrain has "small" complexity.

2
The categories of this paper are: math
22
The categories of this paper are: chao-dyn
35
The categories of this paper are: mtrl-th
6
The categories of this paper are: astro-ph
23
The categories of this paper are: solv-int
0
The categories of this paper are: hep-ph
26
The categories of this paper are: bayes-an
12
The categories of this paper are: nucl-th
30
The categories of this paper are: q-alg
8
The categories of this paper are: hep-ex
37
The categories of this paper are: supr-con
24
The categories of this paper are: dg-ga
19
The categories of this paper are: eess
10
The categories of this paper are: q-bio
9
The categories of this paper are: nlin
13
The categories of this paper are: quant-ph