Competitive Searching for a Line on a Line Arrangement.
From MaRDI portal
Publication:5091041
DOI10.4230/LIPIcs.ISAAC.2018.49OpenAlexW2907381496MaRDI QIDQ5091041
Arthur van Goethem, Thom Castermans, Quirijn W. Bouts, Wouter Meulemans, Marc J. van Kreveld
Publication date: 21 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.ISAAC.2018.49
Cites Work
- Online algorithms for searching and exploration in the plane
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- A competitive analysis of algorithms for searching unknown scenes
- Searching in the plane
- How to find a point on a line within a fixed distance
- The theory of search games and rendezvous.
- Competitive online routing in geometric graphs
- Parallel searching in the plane
- Online searching with an autonomous robot
- Online searching with turn cost
- Searching on a line: a complete characterization of the optimal solution
- Yet more on the linear search problem
- On a Dynamic Programming Approach to the Caterer Problem—I
- The Polygon Exploration Problem
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles
- Navigating in Unfamiliar Geometric Terrain
- Competitive Online Routing on Delaunay Triangulations
- An Optimal Competitive Strategy for Walking in Streets
- Online Routing in Triangulations
- ONLINE ROUTING IN CONVEX SUBDIVISIONS
- The ultimate strategy to search on \(m\) rays?
- Parallel searching on \(m\) rays
This page was built for publication: Competitive Searching for a Line on a Line Arrangement.
