Online search with a hint

DOI10.1016/j.ic.2023.105091arXiv2008.13729OpenAlexW4386898582MaRDI QIDQ6186319

Spyros Angelopoulos

Publication date: 2 February 2024

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.13729

zbMATH Keywords

robustnessconsistencycompetitive analysissearch problemslinear search

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite linear programming and online searching with turn cost
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• Tree exploration with advice
• The linear search problem rides again
• The theory of search games and rendezvous.
• The expanding search ratio of a graph
• On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
• Advice complexity of treasure hunt in geometric terrains
• Son of the linear search problem
• Online searching with turn cost
• Searching on a line: a complete characterization of the optimal solution
• 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
• Online Graph Exploration with Advice
• Treasure Hunt with Advice
• Competitive Online Approximation of the Optimal Search Ratio
• The Oil Searching Problem
• The Revenge of the Linear Search Problem
• Minimax Solutions for Linear Search Problems
• Optimal Constructions of Hybrid Algorithms
• Deterministic Graph Exploration with Advice
• Algorithms with Predictions
• Lower Bounds for Searching Robots, some Faulty
• Lower bounds in on-line geometric searching
• The ultimate strategy to search on \(m\) rays?
• Search on a Line by Byzantine Robots