A general framework for searching on a line
From MaRDI portal
(Redirected from A general framework for searching on a line)
A general framework for searching on a line (scientific article; zbMATH DE number 6576387)
A general framework for searching on a line (scientific article; zbMATH DE number 6576387)
Recommendations
Cites work
- A general search game
- Computational principles of mobile robotics.
- Online Routing in Triangulations
- Online searching with turn cost
- Optimal sequencing of contract algorithms
- Planning Algorithms
- Routing with guaranteed delivery in ad hoc wireless networks
- Search games
- Search Theory
- Searching in the plane
- The theory of search games and rendezvous.
Cited in
(16)- Efficient searching with linear constraints
- A general framework for searching on a line
- Weighted group search on a line (extended abstract)
- Priority evacuation from a disk: the case of \(n \geq 4\)
- Online searching with turn cost
- Revisiting the problem of searching on a line
- A near optimal algorithm for the extended cow-path problem in the presence of relative errors
- Searching for an axis-parallel shoreline
- scientific article; zbMATH DE number 2038742 (Why is no real title available?)
- scientific article; zbMATH DE number 1908228 (Why is no real title available?)
- Competitive Searching for a Line on a Line Arrangement.
- Infinite linear programming and online searching with turn cost
- Linear Search with Terrain-Dependent Speeds
- Wireless evacuation on \(m\) rays with \(k\) searchers
- Search on a Line by Byzantine Robots
- Searching with increasing speeds
This page was built for publication: A general framework for searching on a line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803819)
