Approximating Watchman Routes
From MaRDI portal
Publication:5741768
DOI10.1137/1.9781611973105.60zbMath1422.68254OpenAlexW4232146578WikidataQ29300116 ScholiaQ29300116MaRDI QIDQ5741768
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973105.60
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (8)
Unnamed Item ⋮ Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles ⋮ Observation routes and external watchman routes ⋮ Watchman routes for lines and line segments ⋮ On Romeo and Juliet problems: minimizing distance-to-sight ⋮ On Romeo and Juliet Problems: Minimizing Distance-to-Sight. ⋮ How to Keep an Eye on Small Things ⋮ Solving the Watchman Route Problem with Heuristic Search
This page was built for publication: Approximating Watchman Routes
