Lower bounds in on-line geometric searching

DOI10.1016/S0925-7721(00)00030-4zbMath0976.68160OpenAlexW1993937615MaRDI QIDQ5931368

Sven Schuierer

Publication date: 2 January 2002

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(00)00030-4

zbMATH Keywords

geometric on-line searching problems

Mathematics Subject Classification ID

Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Related Items (15)

On-line parallel heuristics, processor scheduling and robot searching under the competitive framework ⋮ Further connections between contract-scheduling and ray-searching problems ⋮ Study on the existence of the transportation particle tracking model in the interactive medium ⋮ Optimal scheduling of contract algorithms with soft deadlines ⋮ Best-of-both-worlds analysis of online search ⋮ Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs ⋮ Impact of knowledge on the cost of treasure hunt in trees ⋮ Interruptible algorithms for multiproblem solving ⋮ Online search with a hint ⋮ Searching for an axis-parallel shoreline ⋮ Multi-target ray searching problems ⋮ Better Upper Bounds for Searching on a Line with Byzantine Robots ⋮ Search on a line with faulty robots ⋮ Unnamed Item ⋮ Online searching with turn cost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in the plane
• Shortest paths without a map
• Optimal search paths for random variables
• The linear search problem rides again
• Search games
• STACS 99. 16th annual symposium on theoretical aspects of computer science, Trier, Germany, March 4--6, 1999. Proceedings
• How to find a point on a line within a fixed distance
• Son of the linear search problem
• 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
• The Revenge of the Linear Search Problem
• Minimax Solutions for Linear Search Problems
• On the Optimality of the Exponential Functions for Some Minimax Problems
• Optimal Constructions of Hybrid Algorithms
• An optimal on-line algorithm for metrical task system
• Generalized streets revisited
• An Optimal Search Problem

This page was built for publication: Lower bounds in on-line geometric searching