The searchlight problem for road networks
DOI10.1016/J.TCS.2015.04.026zbMATH Open1322.68214OpenAlexW620633796MaRDI QIDQ2354403FDOQ2354403
Authors: Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Łukasz Wrona, Masafumi Yamashita, 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
Recommendations
- An efficient search algorithm for road network optimization
- The shortest path problem on large-scale real-road networks
- Finding \(K\) shortest looping paths in a traffic-light network
- Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
- Search for \(C\)-optimal routes in graphs
- Partial outer convexification for traffic light optimization in road networks
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Searching and pebbling
- Title not available (Why is that?)
- An annotated bibliography on guaranteed graph searching
- Title not available (Why is that?)
- Finding the minimum-distance schedule for a boundary searcher with a flashlight
- Searching for a Mobile Intruder in a Polygonal Region
- Cooperative mobile guards in grids
- The complexity of searching a graph
- Title not available (Why is that?)
- Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
- Some pursuit-evasion problems on grids
- Optimal Algorithms for a Pursuit-Evasion Problem in Grids
- Title not available (Why is that?)
- Guarding a set of line segments in the plane
- A pursuit-evasion problem on a grid
- CLEARING A POLYGON WITH TWO 1-SEARCHERS
- The Searchlight Scheduling Problem
- Vision-based pursuit-evasion in a grid
- Searching a polygonal region by a group of stationary \(k\)-searchers
- On gallery watchmen in grids
- An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
- Covering grids and orthogonal polygons with periscope guards
- Illumination in the presence of opaque line segments in the plane
- Watchman routes for lines and line segments
- Illuminating disjoint line segments in the plane
- An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs
- Searching polyhedra by rotating half-planes
- THE MINIMUM GUARDING TREE PROBLEM
- A complete algorithm for searchlight scheduling
Cited In (2)
This page was built for publication: The searchlight problem for road networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2354403)
