Novel Complexity Results for Temporal Separators with Deadlines

We consider two variants, (s,z,ℓ)-Temporal Separator and (s,z,ℓ)-Temporal Cut, respectively, of the vertex separator and the edge cut problem in temporal graphs. The goal is to remove the minimum number of vertices (temporal edges, respectively) in order to delete all the temporal paths that have time travel at most ℓ between a source vertex s and target vertex z. First, we solve an open problem in the literature showing that (s,z,ℓ)-Temporal Separator is NP-hard even when the underlying graph has pathwidth bounded by four. We complement this result showing that (s,z,ℓ)-Temporal Separator can be solved in polynomial time for graphs of pathwidth bounded by three. Then we consider the approximability of (s,z,ℓ)-Temporal Separator and we show that it cannot be approximated within factor 2Ω(log1−ε |V |) for any constant ε > 0, unless NP ⊆ ZPP (V is the vertex set of the input temporal graph) and that the strict version is approximable within factor ℓ − 1 (we show also that it is unliklely that this factor can be improved). Then we consider the (s,z,ℓ)-Temporal Cut problem, we show that it is APX-hard and we present a 2 log2(2ℓ) approximation algorithm.