Computational complexity of guarding connected plane graphs

@inproceedings{Kobylkin2016ComputationalCO,
  title={Computational complexity of guarding connected plane graphs},
  author={K. S. Kobylkin},
  year={2016}
}
Computational complexity is studied for the problem of stabbing set of straight line segments with the smallest cardinality set of disks of fixed radii r > 0 where the set of segments forms a straight line drawing of some connected planar graph. We claim strong NP-hardness of the problem over the class of 4-connected (i.e. Hamiltonian) plane triangulations… CONTINUE READING