Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures

Details Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures

2010-04-06

arxiv.org/abs/1004.0744v1

Computer Science

Computational Geometry

Scientific paper

We consider the following problem: Given a finite set of straight line segments in the plane, determine the positions of a minimal number of points on the segments, from which guards can see all segments. This problem can be interpreted as looking for a minimal number of locations of policemen, guards, cameras or other sensors, that can observe a network of streets, corridors, tunnels, tubes, etc. We show that the problem is strongly NP-complete even for a set of segments with a cubic graph structure, but in P for tree structures.

Affiliated with

Also associated with

No associations

Rating

Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-56694