Lower bounds in on-line geometric searching metric searching

DOI10.1007/BFb0036204MaRDI QIDQ5055955

Sven Schuierer

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in the plane
• Search games
• Walking an unknown street with bounded detour
• On the linear search problem
• More on the linear search problem
• Yet more on the linear search problem
• A general search game
• The return of the linear search problem
• Minimax Solutions for Linear Search Problems
• On the Optimality of the Exponential Functions for Some Minimax Problems
• AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT
• Generalized streets revisited
• Going home through an unknown street