Minimax Solutions for Linear Search Problems
From MaRDI portal
Publication:4044396
DOI10.1137/0127002zbMATH Open0292.90063OpenAlexW2095419417MaRDI QIDQ4044396FDOQ4044396
Authors: Shmuel Gal 
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
Cited In (24)
- Online searching with turn cost
- Title not available (Why is that?)
- Searching for multiple objects in multiple locations
- The expanding search ratio of a graph
- Two-agent tree evacuation
- Best-of-both-worlds analysis of online search
- A general search game
- Better Upper Bounds for Searching on a Line with Byzantine Robots
- Further connections between contract-scheduling and ray-searching problems
- Lower bounds in on-line geometric searching
- Search Games: A Review
- Online search with a hint
- Search for an immobile entity on a network
- Weighted online search
- Online algorithms for searching and exploration in the plane
- A competitive search game with a moving target
- Competitive search in a network
- Online routing and searching on graphs with blocked edges
- Multi-processor search and scheduling problems with setup cost
- Star search -- a different show
- Lower bounds in on-line geometric searching metric searching
- Wireless evacuation on \(m\) rays with \(k\) searchers
- Infinite linear programming and online searching with turn cost
- Multi-target ray searching problems
This page was built for publication: Minimax Solutions for Linear Search Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044396)
