Work

Approximation Algorithms for Anchored Multiwatchman Routes

Year: 2024

Type: article

Abstract: We study some variants of the k-Watchman Routes problem, the cooperative version of the classic Watchman Route problem in a simple polygon. The k watchmen may be required to see the whole polygon, or some pre-determined quota of area within the polygon, and we want to minimize the maximum length traveled by any watchman. While the single-watchman (k = 1$ version of the problem has received considerable attention and is relatively well understood, much less is known about the multiple watchmen (k >1) variant(s). We provide the first tight approximability results for the anchored k-Watchman Routes problem in a simple polygon, assuming k is fixed, by a fully-polynomial time approximation scheme. The basis for the FPTAS is provided by an exact dynamic programming algorithm. If k varies (i.e., it is part of the input), we give constant-factor approximations.

Source: Computing in Geometry and Topology

DOI: 10.57717/cgt.v4i1.71

Authors: Mitchell, Joseph S.B., Nguyen, Linh

Institution: Stony Brook University

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W6954810702

FWCI:

Cites:

Cited by:

Related to: