Complexity of the Police Officer Patrol Problem

抄録

We introduce an edge routing decision problem called the police officer patrol problem (POPP), which is related to the vertex cover problem. A vertex cover of a graph can be regarded as the placement of police officers or fixed surveillance cameras so that each street of a neighborhood represented by the graph can be confirmed visually without moving from their position. In the edge routing problem we consider, a single police officer must confirm all the streets. The officer is allowed to move, but can confirm any street visually from an incident intersection without traversing it. In this paper, we show that the POPP on mixed graphs is NP-complete.