Multi-target ray searching problems

DOI10.1016/j.tcs.2014.03.028zbMath1359.68280OpenAlexW2086312880MaRDI QIDQ2453158

Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos D. Panagiotou

Publication date: 6 June 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.03.028

zbMATH Keywords

competitive analysis of online algorithmsalternative performance measuresray searchingsearch and exploration algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27)

Related Items

Multi-processor search and scheduling problems with setup cost ⋮ Competitive search in a network ⋮ The beachcombers' problem: walking and searching with mobile robots ⋮ Weighted online search ⋮ The expanding search ratio of a graph ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
• Online searching with turn cost
• On the linear search problem
• Yet more on the linear search problem
• Competitive Online Approximation of the Optimal Search Ratio
• The Oil Searching Problem
• Hyperbolic Dovetailing
• Minimax Solutions for Linear Search Problems
• Optimal Constructions of Hybrid Algorithms
• Lower bounds in on-line geometric searching
• The ultimate strategy to search on \(m\) rays?