Security routing games with multivehicle Chinese postman problem

DOI10.1002/net.21563zbMath1390.90167OpenAlexW2118834450MaRDI QIDQ4642467

Fernando Ordóñez, Dorit S. Hochbaum, Cheng Lyu

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21563

zbMATH Keywords

vehicle routingapproximation algorithmChinese postmansecurity gamesadversarial games

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Cooperative games (91A12)

Related Items (7)

Optimizing periodic patrols against short attacks on the line and other networks ⋮ Continuous Patrolling Games ⋮ Patrolling a Border ⋮ Approximation algorithms for the min-max mixed rural postmen cover problem and its variants ⋮ Approximation algorithms for the min-max mixed rural postmen cover problem and its variants ⋮ Coordinating resources in Stackelberg security games ⋮ Adversarial Patrolling in a Uniform

This page was built for publication: Security routing games with multivehicle Chinese postman problem