Mathematical structures for computer science (2nd ed.)
Mathematical structures for computer science (2nd ed.)
A Cartesian Parallel Nested Dissection Algorithm
SIAM Journal on Matrix Analysis and Applications
Approximating the maximally balanced connected partition problem in graphs
Information Processing Letters
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
| Hi-index | 0.00 |
In this paper we describe a heuristic method, based on graph-partitioning algorithms, with the purpose of improving the demarcation of areas for police patrolling. This demarcation seeks to homogenize the number of crimes among the patrol regions. If the map of a particular region is taken as a graph, we can say that the problem faced by police forces (typically preventive police) is similar to the problem of finding balanced connected q partitions of graphs (BCPq). Since this is a problem belonging to the NP-Hard class, approximate algorithms are the most suitable for solving such a problem. The method described in this article obtains results nearest those considered optimal for the more general case of BCPq, for q≥2.