Competitive perimeter defense in linear environments
From MaRDI portal
Cites work
- A bound for the cops and robbers problem
- A game of cops and robbers played on products of graphs
- A review of multi agent perimeter defense games
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- Algorithms for on-line order batching in an order picking warehouse
- Algorithms for the on-line travelling salesman
- Competitive analysis of randomized paging algorithms
- Continuous Patrolling Games
- Cooperative pursuit with Voronoi partitions
- Cops and robbers from a distance
- Diversion issues in real-time vehicle dispatching
- Hamilton–Jacobi Formulation for Reach–Avoid Differential Games
- How to whack moles
- scientific article; zbMATH DE number 6009880 (Why is no real title available?)
- scientific article; zbMATH DE number 1305099 (Why is no real title available?)
- Lower and upper competitive bounds for online directed graph exploration
- Matching-based capture strategies for 3D heterogeneous multiplayer reach-avoid differential games
- Multiplayer Reach-Avoid Games via Pairwise Outcomes
- On-line single-server dial-a-ride problems
- Optimal evasive strategies for multiple interacting agents with motion constraints
- Patrolling a border
- Patrolling a pipeline
- Patrolling games
- Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
- The game of cops and robbers on graphs
- The multiple traveling salesmen problem with moving targets
- The online TSP against fair adversaries
- Vehicle Routing Algorithms for Radially Escaping Targets
This page was built for publication: Competitive perimeter defense in linear environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985821)
