Observation routes and external watchman routes

DOI10.1016/J.TCS.2024.114818MaRDI QIDQ6633574

Could not fetch data.

Publication date: 6 November 2024

Published in: (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Watchman tours for polygons with holes
• The forest hiding problem
• Shortest watchman routes in simple polygons
• On the complexity of approximating TSP with neighborhoods and related problems
• On the geometric dilation of closed curves, graphs, and point sets
• Geometric dilation of closed planar curves: New lower bounds
• Optimum watchman routes
• Watchman routes under limited visibility
• The Euclidean traveling salesman problem is NP-complete
• Watchman routes in the presence of a pair of convex polygons
• Approximation algorithms for the Geometric Covering Salesman Problem
• Zahlentheoretisches und Wahrscheinlichkeitstheoretisches über die Sichtweite im Walde.
• Fast computation of shortest watchman routes in simple polygons
• Finding the shortest watchman route in a simple polygon
• An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
• A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
• Shortest path to a segment and quickest visibility queries
• A threshold of ln n for approximating set cover
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• The shortest path and the shortest road through n points
• Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
• Touring a sequence of polygons
• APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• On the hardness of approximating minimization problems
• Approximation algorithms for TSP with neighborhoods in the plane
• CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
• A PTAS for Euclidean TSP with Hyperplane Neighborhoods
• How to Keep an Eye on Small Things
• The Art Gallery Problem is ∃ℝ-complete
• Analytical approach to parallel repetition
• TSP with neighborhoods of varying size
• Approximating Watchman Routes
• Parameterized Hardness of Art Gallery Problems
• Inapproximability results for guarding polygons and terrains

This page was built for publication: Observation routes and external watchman routes

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