Weighted online search
From MaRDI portal
Publication:6133641
DOI10.1016/j.jcss.2023.05.002zbMath1529.68326MaRDI QIDQ6133641
Konstantinos D. Panagiotou, Spyros Angelopoulos
Publication date: 21 August 2023
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Cites Work
- 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
- How to find a point on a line within a fixed distance
- Optimal sequencing of contract algorithms
- 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
- Search on a line with faulty robots
- Probabilistically faulty searching on a half-line (extended abstract)
- Competitive search in a network
- Multi-target ray searching problems
- 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
- Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving
- The Oil Searching Problem
- Hyperbolic Dovetailing
- Minimax Solutions for Linear Search Problems
- On the Optimality of the Exponential Functions for Some Minimax Problems
- Optimal Constructions of Hybrid Algorithms
- Algorithms for distributional and adversarial pipelined filter ordering problems
- Lower Bounds for Searching Robots, some Faulty
