Competitive Searching for a Line on a Line Arrangement.
From MaRDI portal
Recommendations
Cites work
- A competitive analysis of algorithms for searching unknown scenes
- An Optimal Competitive Strategy for Walking in Streets
- Competitive online routing in geometric graphs
- Competitive online routing on Delaunay triangulations
- How to find a point on a line within a fixed distance
- Navigating in Unfamiliar Geometric Terrain
- On a dynamic programming approach to the caterer problem. I
- Online algorithms for searching and exploration in the plane
- ONLINE ROUTING IN CONVEX SUBDIVISIONS
- Online Routing in Triangulations
- Online searching with an autonomous robot
- Online searching with turn cost
- Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
- Parallel searching in the plane
- Parallel searching on m rays
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Searching in the plane
- Searching on a line: a complete characterization of the optimal solution
- The polygon exploration problem
- The theory of search games and rendezvous.
- The ultimate strategy to search on \(m\) rays?
- Yet more on the linear search problem
This page was built for publication: Competitive Searching for a Line on a Line Arrangement.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091041)
