Computational complexity and approximability are studied for the problem of intersecting of a set of straight line segments with the smallest cardinality set of disks of fixed radii r > 0 where the set of segments forms straight line embedding of possibly non-planar geometric graph. This problem arises in physical network security analysis for telecommunication, wireless and road networks represented by specific geometric graphs defined by Euclidean distances between their vertices (proximity graphs). It can be formulated in a form of known Hitting Set problem over a set of Euclidean r-neighbourhoods of segments. Being of interest computational complexity and approximability of Hitting Set over so structured sets of geometric objects did not get much focus in the literature. Strong NP-hardness of the problem is reported over special classes of proximity graphs namely of Delaunay triangulations, some of their connected subgraphs, half-θ6 graphs and non-planar unit disk graphs as well as APX-hardness is given for non-planar geometric graphs at different scales of r with respect to the longest graph edge length. Simple constant factor approximation algorithm is presented for the case where r is at the same scale as the longest edge length.

1.
P. K.
Agarwal
,
A.
Efrat
,
S. K.
Ganjugunte
,
D.
Hay
,
S.
Sankararaman
, and
G.
Zussman
,
IEEE/ACM Trans. Netw.
21
,
1525
1538
(
2013
).
2.
J.
O’Rourke
,
Art Gallery Theorems and Algorithms
(
Oxford University Press
,
1987
).
3.
P.
Bose
,
J.-L. D.
Carufel
,
S.
Durocher
, and
P.
Taslakian
, “Competitive online routing on Delaunay triangulations.” in
SWAT, Lecture Notes in Computer Science
, Vol.
8503
, edited by
R.
Ravi
and
I. L.
Gortz
(
Springer
,
2014
), pp.
98
109
.
4.
P.
Bose
,
P.
Morin
,
I.
Stojmenovic
, and
J.
Urrutia
,
Wireless Networks
7
,
609
616
(
2001
).
5.
S. P.
Fekete
,
K.
Huang
,
J. S. B.
Mitchell
,
O.
Parekh
, and
C. A.
Phillips
, “Geometric hitting set for segments of few orientations.” in
WAOA, Lecture Notes in Computer Science
, Vol.
9499
, edited by
L.
Sanit
and
M.
Skutella
(
Springer
,
2015
), pp.
145
157
.
6.
B.
Broden
,
M.
Hammar
, and
B. J.
Nilsson
, “Guarding lines and 2-link polygons is APX-hard.” in
CCCG
(
2001
), pp.
45
48
.
7.
T. F.
Gonzalez
,
Inf. Process. Lett.
40
,
181
188
(
1991
).
8.
E. M.
Arkin
,
A. F.
Anta
,
J. S. B.
Mitchell
, and
M. A.
Mosteiro
,
Comput. Geom.
48
,
134
146
(
2015
).
9.
W.
Schnyder
, “Embedding planar graphs on the grid.” in
SODA
, edited by
D. S.
Johnson
(
SIAM
,
1990
), pp.
138
148
.
This content is only available via PDF.
You do not currently have access to this content.