Optimal patrolling strategies for trees and complete networks
From MaRDI portal
Publication:6096604
DOI10.1016/j.ejor.2023.05.033arXiv2210.15045OpenAlexW4379013633MaRDI QIDQ6096604
Publication date: 15 September 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.15045
Cites Work
- Optimizing periodic patrols against short attacks on the line and other networks
- Continuous patrolling and hiding games
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Patrolling a perimeter
- On the number of 1-factorizations of a complete graph
- A Graph Patrol Problem with Random Attack Times
- Patrolling Games
- Search Games on Trees with Asymmetric Travel Times
- Patrolling a Pipeline
- Search Games with Mobile and Immobile Hider
- Technical Note—Optimal Patrol of a Perimeter
- Continuous Patrolling Games
- Exact and Approximation Algorithms for the Expanding Search Problem
- On Submodular Search and Machine Scheduling
- Searching a Variable Speed Network
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm
This page was built for publication: Optimal patrolling strategies for trees and complete networks
