Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight
From MaRDI portal
Publication:3557011
DOI10.1007/978-3-642-12200-2_9zbMath1283.52021OpenAlexW1514055912MaRDI QIDQ3557011
John Zhang, Ichiro Suzuki, Tsunehiko Kameda
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_9
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
An alternative proof for the equivalence of searcher and 2-searcher ⋮ The searchlight problem for road networks