Cover Image

Approximation Algorithms for Anchored Multiwatchman Routes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mitchell, Joseph S. B., Nguyen, Linh
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multirobot Watchman Routes in a Simple Polygon
by: Mitchell, Joseph S. B., et al.
Published: (2024)

Provable Methods for Searching with an Imperfect Sensor
by: Chakraborty, Nilanjan, et al.
Published: (2024)

Optimizing Visibility-based Search in Polygonal Domains
by: Huynh, Kien C., et al.
Published: (2024)

Proof of Dudley's Convex Approximation
by: Har-Peled, Sariel, et al.
Published: (2019)

On Stable Approximation Algorithms for Geometric Coverage Problems
by: de Berg, Mark, et al.
Published: (2024)

Fast Approximation Algorithms for Piercing Boxes by Points
by: Agarwal, Pankaj K., et al.
Published: (2023)

Approximation Algorithms for the Freeze Tag Problem inside Polygons
by: Rajabi-Alni, Fatemeh, et al.
Published: (2024)

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
by: Lynch, Jayson, et al.
Published: (2025)

Groupes de Brauer algébriques modulo les constants d'espaces homogènes et leurs compactifications
by: Linh, Nguyen Manh
Published: (2022)

Non-abelian descent types
by: Linh, Nguyen Manh
Published: (2023)

Observation Routes and External Watchman Routes
by: Dumitrescu, Adrian, et al.
Published: (2023)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)

Approximation Algorithms for Smallest Intersecting Balls
by: Zheng, Jiaqi, et al.
Published: (2024)

Approximation Algorithms for Minimum Sum of Moving-Distance and Opening-Costs Target Coverage Problem
by: Zhao, Lei, et al.
Published: (2024)

Robustly Guarding Polygons
by: Das, Rathish, et al.
Published: (2024)

Sur les espaces homogènes de Borovoi-Kunyavski\uı
by: Linh, Nguyen Manh
Published: (2022)

Approximate Algorithms for Chamfer Distance Under Translation
by: Halevi, Gil, et al.
Published: (2026)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
by: Liu, Shuilian, et al.
Published: (2025)

Improved Approximation Algorithms for Three-Dimensional Bin Packing
by: Kar, Debajyoti, et al.
Published: (2025)

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets
by: Aichholzer, Oswin, et al.
Published: (2025)

A Simple 2-Approximation Algorithm For Minimum Manhattan Network Problem
by: Sanim, Md. Musfiqur Rahman, et al.
Published: (2024)

Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)

Reliability-based G1 Continuous Arc Spline Approximation
by: Jeon, Jinhwan, et al.
Published: (2024)

Contiguous Boundary Guarding
by: Biniaz, Ahmad, et al.
Published: (2024)

Multiple Watchman Routes in Staircase Polygons
by: Brötzner, Anna, et al.
Published: (2025)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
by: Ebbens, Matthijs, et al.
Published: (2024)

Empirical Analysis Of Heuristic and Approximation Algorithms for the The Mutual-Visibility Problem
by: Stojanović, Vanja, et al.
Published: (2025)

Local Routing on a Convex Polytope in R^3
by: Chandran, Sreehari, et al.
Published: (2025)

Stability and Approximations for Decorated Reeb Spaces
by: Curry, Justin, et al.
Published: (2023)

Approximating the Directed Hausdorff Distance
by: Chubet, Oliver A., et al.
Published: (2025)

Approximation and Hardness of Polychromatic TSP
by: Schibler, Thomas, et al.
Published: (2025)

Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs
by: Bose, Prosenjit, et al.
Published: (2025)

Approximation Depth of Convex Polytopes
by: Bakaev, Egor, et al.
Published: (2025)

Mathematical Programming Algorithms for Convex Hull Approximation with a Hyperplane Budget
by: Barbato, Michele, et al.
Published: (2024)

On Approximation Schemes for Stabbing Rectilinear Polygons
by: Khan, Arindam, et al.
Published: (2024)

Approximating Densest Subgraph in Geometric Intersection Graphs
by: Har-Peled, Sariel, et al.
Published: (2024)

Approximating Convex Hulls via Range Queries
by: Schibler, T., et al.
Published: (2026)

Optimal Area-Sensitive Bounds for Polytope Approximation
by: Arya, Sunil, et al.
Published: (2023)

Hardness and Approximation Schemes for Discrete Packing and Domination
by: Madireddy, Raghunath Reddy, et al.
Published: (2025)

Optimal Volume-Sensitive Bounds for Polytope Approximation
by: Arya, Sunil, et al.
Published: (2023)