Alternating search at two locations
From MaRDI portal
Publication:5938010
DOI10.1023/A:1011245715521zbMath0996.90049OpenAlexW1536009348MaRDI QIDQ5938010
Publication date: 6 November 2002
Published in: Dynamics and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011245715521
Programming involving graphs or networks (90C35) Search theory (90B40) Control/observation systems governed by ordinary differential equations (93C15)
Related Items (9)
Hide-and-seek games on a tree to which Eulerian networks are attached ⋮ On Submodular Search and Machine Scheduling ⋮ Ten Open Problems in Rendezvous Search ⋮ Network search games with immobile hider, without a designated searcher starting point ⋮ Line-of-sight rendezvous ⋮ A new approach to Gal's theory of search games on weakly Eulerian networks ⋮ Searching symmetric networks with Utilitarian-Postman paths ⋮ Searching a Variable Speed Network ⋮ Static search games played over graphs and general metric spaces
This page was built for publication: Alternating search at two locations
