    Parameterized algorithms and data reduction for safe convoy routing

We study a problem that models safely routing a convoy through a transportation network, where any vertex adjacent to the travel path of the convoy requires additional precaution: Given a graph G=(V,E), two vertices s,t∈ V, and two integers k,ℓ, we search for a simple s-t-path with at most k vertices and at most ℓ neighbors. We study the problem in two types of transportation networks: graphs with small crossing number, as formed by road networks, and tree-like graphs, as formed by waterways. For graphs with constant crossing number, we provide a subexponential 2^O(√(n))-time algorithm and prove a matching lower bound. We also show a polynomial-time data reduction algorithm that reduces any problem instance to an equivalent instance (a so-called problem kernel) of size polynomial in the vertex cover number of the input graph. In contrast, we show that the problem in general graphs is hard to preprocess. Regarding tree-like graphs, we obtain a 2^O(tw)·ℓ^2· n-time algorithm for graphs of treewidth tw, show that there is no problem kernel with size polynomial in tw, yet show a problem kernel with size polynomial in the feedback edge number of the input graph.

Authors

06/25/2018

Parameterized algorithms and data reduction for the short secluded s-t-path problem

Given a graph G=(V,E), two vertices s,t∈ V, and two integers k,ℓ, we sea...
11/11/2019

A polynomial kernel for 3-leaf power deletion

A graph G is an ℓ-leaf power of a tree T if V(G) is equal to the set of ...
07/08/2020

FPT and kernelization algorithms for the k-in-a-tree problem

The three-in-a-tree problem asks for an induced tree of the input graph ...
01/08/2019

Subset Feedback Vertex Set in Chordal and Split Graphs

In the Subset Feedback Vertex Set (Subset-FVS) problem the input is a gr...
09/18/2017

Crossing Patterns in Nonplanar Road Networks

We define the crossing graph of a given embedded graph (such as a road n...
01/23/2020