Minimax Solutions for Linear Search Problems
From MaRDI portal
Publication:4044396
DOI10.1137/0127002zbMath0292.90063OpenAlexW2095419417MaRDI QIDQ4044396
Publication date: 1974
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0127002
Related Items (24)
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 ⋮ Competitive search in a network ⋮ Best-of-both-worlds analysis of online search ⋮ Weighted online search ⋮ Search Games: A Review ⋮ Online search with a hint ⋮ Online algorithms for searching and exploration in the plane ⋮ Multi-target ray searching problems ⋮ Search for an immobile entity on a network ⋮ Better Upper Bounds for Searching on a Line with Byzantine Robots ⋮ The expanding search ratio of a graph ⋮ Infinite linear programming and online searching with turn cost ⋮ Searching for multiple objects in multiple locations ⋮ Lower bounds in on-line geometric searching ⋮ Unnamed Item ⋮ Online searching with turn cost ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers ⋮ Star search -- a different show ⋮ A general search game ⋮ Two-agent tree evacuation
This page was built for publication: Minimax Solutions for Linear Search Problems
