DeepAI AI Chat
Log In Sign Up

Fixed-Parameter Tractable Algorithms for Corridor Guarding Problems

by   Remi Raman, et al.

Given an orthogonal connected arrangement of line-segments, Minimum Corridor Guarding(MCG) problem asks for an optimal tree/closed walk such that, if a guard moves through the tree/closed walk, all the line-segments are visited by the guard. This problem is referred to as Corridor-MST/Corridor-TSP (CMST/CTSP) for the cases when the guarding walk is a tree/closed walk, respectively. The corresponding decision version of MCG is shown to be NP-Complete[1]. The parameterized version of CMST/CTSP referred to as k-CMST/k-CTSP, asks for an optimal tree/closed walk on at most k vertices, that visits all the line-segments. Here, vertices correspond to the endpoints and intersection points of the input line-segments. We show that k-CMST/k-CTSP is fixed-parameter tractable (FPT) with respect to the parameter k. Next, we propose a variant of CTSP referred to as Minimum Link CTSP(MLC), in which the link-distance of the closed walk has to be minimized. Here, link-distance refers to the number of links or connected line-segments with same orientation in the walk. We prove that the decision version of MLC is NP-Complete, and show that the parameterized version, namely b-MLC, is FPT with respect to the parameter b, where b corresponds to the link-distance. We also consider another related problem, the Minimum Corridor Connection (MCC). Given a rectilinear polygon partitioned into rectilinear components or rooms, MCC asks for a minimum length tree along the edges of the partitions, such that every room is incident to at least one vertex of the tree. The decision version of MCC is shown to be NP-Complete[2]. We prove the fixed parameter tractability of the parameterized version of MCC, namely k-MCC with respect to the parameter k, where k is the number of rooms.


page 1

page 2

page 3

page 4


On the Parameterized Complexity of the Acyclic Matching Problem

A matching is a set of edges in a graph with no common endpoint. A match...

On the Tractability of Defensive Alliance Problem

Given a graph G = (V, E), a non-empty set S ⊆ V is a defensive alliance,...

The Parametrized Complexity of the Segment Number

Given a straight-line drawing of a graph, a segment is a maximal set of ...

Rectangular Partitions of a Rectilinear Polygon

We investigate the problem of partitioning a rectilinear polygon P with ...

On Structural Parameterizations of Load Coloring

Given a graph G and a positive integer k, the 2-Load coloring problem is...

Parameterized temporal exploration problems

In this paper we study the fixed-parameter tractability of the problem o...

Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs

A rotor walk in a directed graph can be thought of as a deterministic ve...