The searchlight problem for road networks
From MaRDI portal
Publication:2354403
DOI10.1016/j.tcs.2015.04.026zbMath1322.68214OpenAlexW620633796MaRDI QIDQ2354403
Masafumi Yamashita, Łukasz Wrona, Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Paweł Żyliński
Publication date: 13 July 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.04.026
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Guarding a set of line segments in the plane
- Searching a polygonal region by a group of stationary \(k\)-searchers
- Cooperative mobile guards in grids
- An annotated bibliography on guaranteed graph searching
- On gallery watchmen in grids
- Some pursuit-evasion problems on grids
- An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
- An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs
- A pursuit-evasion problem on a grid
- Illuminating disjoint line segments in the plane
- Searching and pebbling
- Covering grids and orthogonal polygons with periscope guards
- Watchman routes for lines and line segments
- Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
- A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING
- The Searchlight Scheduling Problem
- Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight
- CLEARING A POLYGON WITH TWO 1-SEARCHERS
- The complexity of searching a graph
- Optimal Algorithms for a Pursuit-Evasion Problem in Grids
- Searching for a Mobile Intruder in a Polygonal Region
- SEARCHING POLYHEDRA BY ROTATING HALF-PLANES
- THE MINIMUM GUARDING TREE PROBLEM
- Vision-Based Pursuit-Evasion in a Grid
- Illumination in the presence of opaque line segments in the plane
