\(k\)-Transmitter watchman routes

DOI10.1007/978-3-031-27051-2_18arXiv2202.01757MaRDI QIDQ6091164

Bengt J. Nilsson, Christiane Schmidt

Publication date: 24 November 2023

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmNP-completenessNP-hardnesswatchman route\(k\)-transmitter\(k\)-transmitter watchman route

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Watchman tours for polygons with holes
• Shortest watchman routes in simple polygons
• Optimum watchman routes
• Computing vision points in polygons
• Fast computation of shortest watchman routes in simple polygons
• Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
• Modem illumination of monotone polygons
• Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation
• Coverage with k-Transmitters in the Presence of Obstacles
• Touring a sequence of polygons
• Minimum Covering with Travel Cost
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
• OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS

This page was built for publication: \(k\)-Transmitter watchman routes