scientific article; zbMATH DE number 7559116

DOI10.4230/LIPIcs.STACS.2019.7MaRDI QIDQ5090453

Spyros Angelopoulos, Shendan Jin, Christoph Dürr

Publication date: 18 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

performance measuressearch problemslinear searchonline computation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

A nearly tight lower bound for the \(d\)-dimensional cow-path problem, Online search with a hint

Cites Work

• Unnamed Item
• Unnamed Item
• A comparison of performance measures for online algorithms
• 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
• Search games
• How to find a point on a line within a fixed distance
• The theory of search games and rendezvous.
• On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
• Stochastic dominance and the bijective ratio of online algorithms
• A comparison of performance measures via online search
• Online searching with turn cost
• Searching on a line: a complete characterization of the optimal solution
• On the linear search problem
• Yet more on the linear search problem
• A general search game
• The Oil Searching Problem
• Hyperbolic Dovetailing
• Minimax Solutions for Linear Search Problems
• Search on a Line by Byzantine Robots
• Algorithms for distributional and adversarial pipelined filter ordering problems
• Paging and list update under bijective analysis
• Lower bounds in on-line geometric searching