Minimax Solutions for Linear Search Problems
From MaRDI portal
(Redirected from Publication:4044396)
Cited in
(26)- Online searching with turn cost
- scientific article; zbMATH DE number 7559116 (Why is no real title available?)
- Searching for multiple objects in multiple locations
- Searching in Euclidean spaces with predictions
- The expanding search ratio of a graph
- Two-agent tree evacuation
- Online search with a hint
- Search games: a review
- Best-of-both-worlds analysis of online search
- A general search game
- Further connections between contract-scheduling and ray-searching problems
- Search for an immobile entity on a network
- Lower bounds in on-line geometric searching
- Online search with a hint
- Online algorithms for searching and exploration in the plane
- Weighted online search
- A competitive search game with a moving target
- Competitive search in a network
- Online routing and searching on graphs with blocked edges
- Star search -- a different show
- Multi-processor search and scheduling problems with setup cost
- 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
- Better upper bounds for searching on a line with Byzantine robots
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)
