Approximation algorithms for anchored multiwatchman routes

DOI10.57717/CGT.V4I1.71MaRDI QIDQ6913059zbMATH OpenFDO

Authors Joseph S. B. Mitchell, Linh Nguyen

Publication date 21 October 2025

Published in CGT. Computing in Geometry and Topology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.57717/CGT.V4I1.71

zbMATH Keywords

k-watchman routesquota watchman routewatchman route

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites work

• AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
• Approximating watchman routes
• Approximation algorithms for the watchman route and zookeeper's problems.
• CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
• Finding the shortest watchman route in a simple polygon
• scientific article; zbMATH DE number 6776481 (Why is no real title available?)
• On Steiner’s Problem with Rectilinear Distance
• Optimizing visibility-based search in polygonal domains
• Shortest path to a segment and quickest visibility queries
• Shortest watchman routes in simple polygons
• Touring a sequence of polygons
• Triangulating a simple polygon in linear time
• Watchman tours for polygons with holes

This page was built for publication: Approximation algorithms for anchored multiwatchman routes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913059)