A general search game
From MaRDI portal
Publication:2558250
DOI10.1007/BF02764811zbMath0253.90070OpenAlexW2046464993MaRDI QIDQ2558250
Publication date: 1972
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02764811
Related Items (17)
Lower bounds in on-line geometric searching metric searching ⋮ Further connections between contract-scheduling and ray-searching problems ⋮ A competitive search game with a moving target ⋮ Multi-processor search and scheduling problems with setup cost ⋮ Online routing and searching on graphs with blocked edges ⋮ A general framework for searching on a line ⋮ Competitive search in a network ⋮ Best-of-both-worlds analysis of online search ⋮ Weighted online search ⋮ Online search with a hint ⋮ Search for an immobile entity on a network ⋮ The expanding search ratio of a graph ⋮ Lower bounds in on-line geometric searching ⋮ Unnamed Item ⋮ Online searching with turn cost ⋮ Search for an immobile hider on a stochastic network ⋮ A General Framework for Searching on a Line
Cites Work
This page was built for publication: A general search game
