Scalable Algorithms with Provable Optimality Bounds for the Multiple Watchman Route Problem