Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Geometric Hitting Set for Segments of Few Orientations   We study several natural instances of the geometric hitting set problem for
input consisting of sets of line segments (and rays, lines) having a small
number of distinct slopes. These problems model path monitoring (e.g., on road
networks) using the fewest sensors (the "hitting points"). We give
approximation algorithms for cases including (i) lines of 3 slopes in the
plane, (ii) vertical lines and horizontal segments, (iii) pairs of
horizontal/vertical segments. We give hardness and hardness of approximation
results for these problems. We prove that the hitting set problem for vertical
lines and horizontal rays is polynomially solvable.

9
The categories of this paper are: nlin
18
The categories of this paper are: econ
24
The categories of this paper are: dg-ga
13
The categories of this paper are: quant-ph
36
The categories of this paper are: cmp-lg
28
The categories of this paper are: alg-geom
27
The categories of this paper are: comp-gas
25
The categories of this paper are: patt-sol
22
The categories of this paper are: chao-dyn
15
The categories of this paper are: nucl-ex
29
The categories of this paper are: funct-an
21
The categories of this paper are: adap-org
20
The categories of this paper are: acc-phys
0
The categories of this paper are: hep-ph
16
The categories of this paper are: stat
3
The categories of this paper are: physics