Searching on a line: a complete characterization of the optimal solution

DOI10.1016/j.tcs.2014.12.007zbMath1312.68210MaRDI QIDQ2513671

Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher

Publication date: 28 January 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.007

zbMATH Keywords

optimization; online algorithms; computational geometry; Fibonacci polynomials

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68W27: Online algorithms; streaming algorithms

Related Items

Wireless evacuation on \(m\) rays with \(k\) searchers, Infinite linear programming and online searching with turn cost, A general framework for searching on a line, The expanding search ratio of a graph, Linear search by a pair of distinct-speed robots, Competitive search in a network, Linear Search by a Pair of Distinct-Speed Robots

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asynchronous deterministic rendezvous in bounded terrains
• Searching in the plane
• Numerical methods for roots of polynomials. Part I
• How to find a point on a line within a fixed distance
• The theory of search games and rendezvous.
• Numerical methods for roots of polynomials. II
• Asynchronous deterministic rendezvous in graphs
• Revisiting the Problem of Searching on a Line
• Tell Me Where I Am So I Can Meet You Sooner
• Rendezvous search on a graph
• Search Theory
• Anonymous Meeting in Networks
• The ultimate strategy to search on \(m\) rays?
• Parallel searching on \(m\) rays