Best-of-both-worlds analysis of online search
From MaRDI portal
Publication:6066770
DOI10.1007/s00453-023-01165-5MaRDI QIDQ6066770
Shendan Jin, Spyros Angelopoulos, Christoph Dürr
Publication date: 13 December 2023
Published in: Algorithmica (Search for Journal in Brave)
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
- Multi-processor search and scheduling problems with setup cost
- 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
- Note: Online Searching / on the Optimality of the Geometric Sequences for the m Ray Search Online Searching
- 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
- Beyond Competitive Analysis
- Lower Bounds for Searching Robots, some Faulty
- Paging and list update under bijective analysis
- Lower bounds in on-line geometric searching
This page was built for publication: Best-of-both-worlds analysis of online search
