Infinite linear programming and online searching with turn cost
DOI10.1016/J.TCS.2017.01.013zbMATH Open1359.68320OpenAlexW2582579716MaRDI QIDQ515543FDOQ515543
Authors: Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr 
Publication date: 16 March 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.sorbonne-universite.fr/hal-01452876/file/Angelopoulos_Infinite_linear.pdf
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Online algorithms; streaming algorithms (68W27) Linear programming (90C05)
Cites Work
- Searching in the plane
- The theory of search games and rendezvous.
- Duality in infinite dimensional linear programming
- Duality gaps in semi-infinite linear programming—an approximation problem
- Hyperbolic Dovetailing
- The ultimate strategy to search on \(m\) rays?
- 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
- Minimax Solutions for Linear Search Problems
- Optimal Constructions of Hybrid Algorithms
- Title not available (Why is that?)
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- The search game on a network with immobile hider
- Searching on a line: a complete characterization of the optimal solution
- The Oil Searching Problem
Cited In (12)
- Online searching with turn cost
- Title not available (Why is that?)
- Online failure diagnosis in interdependent networks
- Best-of-both-worlds analysis of online search
- Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
- Further connections between contract-scheduling and ray-searching problems
- Overcoming probabilistic faults in disoriented linear search
- Online search with a hint
- Weighted online search
- Competitive search in a network
- Impact of knowledge on the cost of treasure hunt in trees
- Multi-processor search and scheduling problems with setup cost
This page was built for publication: Infinite linear programming and online searching with turn cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515543)
