Revisiting the Problem of Searching on a Line

DOI10.1007/978-3-642-40450-4_18zbMath1394.68166arXiv1310.1048OpenAlexW1548168317MaRDI QIDQ2849311

Stephane Durocher, Jean-Lou De Carufel, Prosenjit Bose

Publication date: 17 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (11)

Linear Search with Terrain-Dependent Speeds ⋮ Multi-processor search and scheduling problems with setup cost ⋮ Search on a Line by Byzantine Robots ⋮ Search and rescue on the line ⋮ Deterministic treasure hunt and rendezvous in arbitrary connected graphs ⋮ Priority evacuation from a disk: the case of \(n \geq 4\) ⋮ Lower bounds for searching robots, some faulty ⋮ Search on a line with faulty robots ⋮ Fast two-robot disk evacuation with wireless communication ⋮ Searching on a line: a complete characterization of the optimal solution ⋮ Exploration of High-Dimensional Grids by Finite Automata

This page was built for publication: Revisiting the Problem of Searching on a Line